The following pages link to Finite-turn checking automata (Q2550634):
Displaying 16 items.
- Familles de langages fermées par crochet ouvert (Q598819) (← 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)
- Tree transducers, L systems, and two-way machines (Q1136239) (← links)
- Reset machines (Q1136756) (← links)
- 2DST mappings of languages and related problems (Q1164438) (← links)
- Control sets on context-free grammar forms (Q1238638) (← links)
- One way finite visit automata (Q1242687) (← links)
- Classes of formal grammars (Q1248342) (← links)
- On two-way sequential transductions of full semi-AFL's (Q1249942) (← links)
- Equivalence problem of mappings relative to languages (Q1364102) (← links)
- Controlled pushdown automata (Q1394126) (← links)
- Single-tape reset machines (Q3709914) (← links)
- Image theorems for simple matrix languages andn-parallel languages (Q4074391) (← links)
- (Q4122826) (← links)
- On languages with a certain prefix property (Q4131045) (← links)