The following pages link to One way finite visit automata (Q1242687):
Displayed 33 items.
- Basic tree transducers (Q579951) (← links)
- Sur les générateurs algébriques et linéaires (Q599515) (← links)
- Hierarchies of hyper-AFLs (Q1058860) (← links)
- A note on Parikh maps, abstract languages, and decision problems (Q1065555) (← links)
- The Dyck language \(D_ 1^{'*}\) is not generated by any matrix grammar of finite index (Q1099632) (← links)
- Representations of language families by homomorphic equality operations and generalized equality sets (Q1099633) (← links)
- Tree transducers, L systems, and two-way machines (Q1136239) (← links)
- Reset machines (Q1136756) (← links)
- Independance forte de certaines opérations (Q1151759) (← links)
- 2DST mappings of languages and related problems (Q1164438) (← links)
- The string generating power of context-free hypergraph grammars (Q1176107) (← links)
- Iterated stack automata and complexity classes (Q1183602) (← links)
- Control sets on context-free grammar forms (Q1238638) (← links)
- On languages specified by relative acceptance (Q1249438) (← links)
- On two-way sequential transductions of full semi-AFL's (Q1249942) (← links)
- Some decision problems concerning sequential transducers and checking automata (Q1256855) (← links)
- Equivalence problem of mappings relative to languages (Q1364102) (← links)
- The power of two-way deterministic checking stack automata (Q1812540) (← links)
- Even linear simple matrix languages: formal language properties and grammatical inference. (Q1853536) (← links)
- Visit-bounded stack automata (Q2163998) (← links)
- The failure of the strong pumping lemma for multiple context-free languages (Q2254497) (← links)
- Ogden's lemma, multiple context-free grammars, and the control language hierarchy (Q2280330) (← links)
- Uniform simulations of nondeterministic real time multitape turing machines (Q3771615) (← links)
- Iterated linear control and iterated one-turn pushdowns (Q3776663) (← links)
- The equivalence of deterministic gsm replications onQ-rational languages is decidable (Q3779775) (← links)
- (Q3956424) (← links)
- (Q4168079) (← links)
- (Q4170259) (← links)
- Concatenation of graphs (Q4645288) (← links)
- Outils et résultats pour les transducteurs boustrophédons (Q4728282) (← links)
- Three hierarchies of transducers (Q4747534) (← links)
- Gaining Power by Input Operations: Finite Automata and Beyond (Q5200048) (← links)
- Visit-bounded stack automata (Q6056625) (← links)