scientific article; zbMATH DE number 2040896
From MaRDI portal
Publication:4452052
zbMATH Open1037.68088MaRDI QIDQ4452052FDOQ4452052
Publication date: 11 February 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2710/27100055.htm
Title of this publication is not available (Why is that?)
Recommendations
- Restarting automata, Church-Rosser languages, and representations of {r. e. \ }languages
- scientific article; zbMATH DE number 1836418
- On special forms of restarting automata
- scientific article; zbMATH DE number 1747447
- Hierarchical Relaxations of the Correctness Preserving Property for Restarting Automata
- Restarting transducers, regular languages, and rational relations
- Restarting automata
- An automata-theoretic characterization of the Chomsky-hierarchy
- On determinism versus nondeterminism for restarting automata
- Restarting Tree Automata
Cited In (26)
- SHRINKING RESTARTING AUTOMATA
- Restarting Tree Automata and Linear Context-Free Tree Languages
- A Complete Taxonomy of Restarting Automata without Auxiliary Symbols*
- Sequential monotonicity for restarting automata
- Binding-blocking automata
- Title not available (Why is that?)
- Restarting Automata with Auxiliary Symbols and Small Lookahead
- Title not available (Why is that?)
- Marcus \(t\)-contextual grammars and cut hierarchies and monotonicity for restarting automata
- On the complexity of 2-monotone restarting automata
- On special forms of restarting automata
- A survey on automata with translucent letters
- Left-to-right regular languages and two-way restarting automata
- Mathematical Foundations of Computer Science 2005
- Two-dimensional hierarchies of proper languages of lexicalized FRR-automata
- Context-free languages can be accepted with absolutely no space overhead
- Degrees of non-monotonicity for restarting automata
- Restarting automata with restricted utilization of auxiliary symbols
- Restarting automata, Church-Rosser languages, and representations of {r. e. \ }languages
- A hierarchy of monotone deterministic non-forgetting restarting automata
- Restarting Tree Automata
- On properties of languages accepted by deterministic pushdown automata with translucent input letters
- Succinct description of regular languages by weak restarting automata
- Decidability Questions for Insertion Systems and Related Models
- On determinism versus nondeterminism for restarting automata
- Title not available (Why is that?)
Uses Software
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4452052)
