One way finite visit automata
From MaRDI portal
Publication:1242687
DOI10.1016/0304-3975(78)90035-XzbMATH Open0368.68059MaRDI QIDQ1242687FDOQ1242687
Authors: Sheila A. Greibach 
Publication date: 1978
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Reversal-bounded multipushdown machines
- On Context-Free Languages
- On Relations Defined by Generalized Finite Automata
- Quasi-realtime languages
- On certain formal properties of grammars
- An Infinite Hierarchy of Context-Free Languages
- Finite-Turn Pushdown Automata
- Title not available (Why is that?)
- Left-derivation bounded languages
- A Note on Tape-Bounded Complexity Classes and Linear Context-Free languages
- Linear Automaton Transformations
- Stack Machines and Classes of Nonnested Macro Languages
- A geometric hierarchy of languages
- Control sets on context-free grammar forms
- Checking automata and one-way stack languages
- Control sets on linear grammars
- Control sets on grammars
- Uniformly erasable AFL
- Principal AFL
- Finite-turn checking automata
- Title not available (Why is that?)
- Studies in abstract families of languages
- Chains of full AFL's
- Syntactic operators on full semiAFLs
- Derivation-bounded languages
- AFL with the semilinear property
- The complexity of the membership problem for some extensions of context-free languagest†
- On equal matrix languages
- Phrase structure languages, finite machines, and channel capacity
- The reduction of tape reversals for off-line one-tape Turing machines
- Tape-reversal bounded Turing machine computations
- Controlled pushdown automata
- Absolutely parallel grammars and two-way finite-state transducers
- Bounded-crossing transducers
- Simple Representations of Certain Classes of Languages
- Two-way sequential transductions and stack automata
- Two-way A-transducers and AFL
- On AFL generators for finitely encoded AFA
Cited In (33)
- The power of two-way deterministic checking stack automata
- On two-way sequential transductions of full semi-AFL's
- Representations of language families by homomorphic equality operations and generalized equality sets
- The Dyck language \(D_ 1^{'*}\) is not generated by any matrix grammar of finite index
- On languages specified by relative acceptance
- Some decision problems concerning sequential transducers and checking automata
- The string generating power of context-free hypergraph grammars
- 2DST mappings of languages and related problems
- Concatenation of graphs
- Basic tree transducers
- The failure of the strong pumping lemma for multiple context-free languages
- Control sets on context-free grammar forms
- Independance forte de certaines opérations
- Iterated stack automata and complexity classes
- Reset machines
- Tree transducers, L systems, and two-way machines
- Visit-bounded stack automata
- Visit-bounded stack automata
- Sur les générateurs algébriques et linéaires
- Ogden's lemma, multiple context-free grammars, and the control language hierarchy
- Uniform simulations of nondeterministic real time multitape turing machines
- Iterated linear control and iterated one-turn pushdowns
- The equivalence of deterministic gsm replications onQ-rational languages is decidable
- Three hierarchies of transducers
- Hierarchies of hyper-AFLs
- Outils et résultats pour les transducteurs boustrophédons
- Gaining Power by Input Operations: Finite Automata and Beyond
- A note on Parikh maps, abstract languages, and decision problems
- Equivalence problem of mappings relative to languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- Even linear simple matrix languages: formal language properties and grammatical inference.
- Title not available (Why is that?)
This page was built for publication: One way finite visit automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1242687)
