Cites work
- scientific article; zbMATH DE number 3548457 (Why is no real title available?)
- scientific article; zbMATH DE number 3254905 (Why is no real title available?)
- A Note on Tape-Bounded Complexity Classes and Linear Context-Free languages
- A geometric hierarchy of languages
- AFL with the semilinear property
- Absolutely parallel grammars and two-way finite-state transducers
- An Infinite Hierarchy of Context-Free Languages
- Bounded-crossing transducers
- Chains of full AFL's
- Checking automata and one-way stack languages
- Control sets on context-free grammar forms
- Control sets on grammars
- Control sets on linear grammars
- Controlled pushdown automata
- Derivation-bounded languages
- Finite-Turn Pushdown Automata
- Finite-turn checking automata
- Left-derivation bounded languages
- Linear Automaton Transformations
- On AFL generators for finitely encoded AFA
- On Context-Free Languages
- On Relations Defined by Generalized Finite Automata
- On certain formal properties of grammars
- On equal matrix languages
- Phrase structure languages, finite machines, and channel capacity
- Principal AFL
- Quasi-realtime languages
- Reversal-bounded multipushdown machines
- Simple Representations of Certain Classes of Languages
- Stack Machines and Classes of Nonnested Macro Languages
- Studies in abstract families of languages
- Syntactic operators on full semiAFLs
- Tape-reversal bounded Turing machine computations
- The complexity of the membership problem for some extensions of context-free languagest†
- The reduction of tape reversals for off-line one-tape Turing machines
- Two-way A-transducers and AFL
- Two-way sequential transductions and stack automata
- Uniformly erasable AFL
Cited in
(33)- scientific article; zbMATH DE number 3776895 (Why is no real title available?)
- 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
- Iterated stack automata and complexity classes
- Independance forte de certaines opérations
- Reset machines
- Tree transducers, L systems, and two-way machines
- Sur les générateurs algébriques et linéaires
- Visit-bounded stack automata
- Visit-bounded stack automata
- 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
- Hierarchies of hyper-AFLs
- Three hierarchies of transducers
- Outils et résultats pour les transducteurs boustrophédons
- A note on Parikh maps, abstract languages, and decision problems
- Gaining Power by Input Operations: Finite Automata and Beyond
- Equivalence problem of mappings relative to languages
- scientific article; zbMATH DE number 3602690 (Why is no real title available?)
- scientific article; zbMATH DE number 3604381 (Why is no real title available?)
- Even linear simple matrix languages: formal language properties and grammatical inference.
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)
