Pages that link to "Item:Q2532393"
From MaRDI portal
The following pages link to Checking automata and one-way stack languages (Q2532393):
Displayed 46 items.
- Basic tree transducers (Q579951) (← links)
- Familles de langages fermées par crochet ouvert (Q598819) (← links)
- Syntactic operators on full semiAFLs (Q758321) (← links)
- Hierarchies of hyper-AFLs (Q1058860) (← links)
- Extended macro grammars and stack controlled machines (Q1064075) (← links)
- On pebble automata (Q1088408) (← 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)
- 2DST mappings of languages and related problems (Q1164438) (← links)
- Iterated stack automata and complexity classes (Q1183602) (← links)
- Two-way A-transducers and AFL (Q1216181) (← links)
- Uniformly erasable AFL (Q1225462) (← links)
- Bounded AFLs (Q1227455) (← links)
- Characterization theorems on abstract families of transducers (Q1230515) (← links)
- Proving containment of bounded AFL (Q1230665) (← links)
- Control sets on context-free grammar forms (Q1238638) (← links)
- On the complexity of formal grammars (Q1239000) (← links)
- One way finite visit automata (Q1242687) (← links)
- On two-way sequential transductions of full semi-AFL's (Q1249942) (← links)
- Stack languages and log n space (Q1250712) (← links)
- Some decision problems concerning sequential transducers and checking automata (Q1256855) (← links)
- Transducers and the decidability of independence in free monoids (Q1341744) (← links)
- The power of two-way deterministic checking stack automata (Q1812540) (← links)
- Theory of formal grammars (Q1846334) (← links)
- Some decision problems concerning semilinearity and commutation. (Q1872706) (← links)
- Alternating and empty alternating auxiliary stack automata. (Q1874397) (← links)
- Deep pushdown automata (Q2491213) (← links)
- Principal AFL (Q2540269) (← links)
- Finite-turn checking automata (Q2550634) (← links)
- Substitution and bounded languages (Q2550965) (← links)
- Absolutely parallel grammars and two-way finite-state transducers (Q2555753) (← links)
- On AFL generators for finitely encoded AFA (Q2556749) (← links)
- Characterizations of some tape and time complexity classes of Turing machines in terms of multihead and auxiliary stack automata (Q2558752) (← links)
- Uniform simulations of nondeterministic real time multitape turing machines (Q3771615) (← links)
- Characterizing the polynomial hierarchy by alternating auxiliary pushdown automata (Q3816981) (← links)
- Compelled operations and operations of degreeP (Q3890132) (← links)
- (Q3956424) (← links)
- (Q4122826) (← links)
- On languages with a certain prefix property (Q4131045) (← links)
- Comparing language operations (Q4146261) (← links)
- (Q4168079) (← links)
- The complexity of the membership problem for some extensions of context-free languagest† (Q4181980) (← links)
- Outils et résultats pour les transducteurs boustrophédons (Q4728282) (← links)
- Tree-stack automata (Q4879207) (← links)
- (Q5446606) (← links)
- Chains of full AFL's (Q5603191) (← links)