The following pages link to One-way stack automata (Q5557460):
Displaying 50 items.
- Further remarks on DNA overlap assembly (Q515580) (← links)
- Familles de langages fermées par crochet ouvert (Q598819) (← links)
- Cayley automata (Q685452) (← links)
- Syntactic operators on full semiAFLs (Q758321) (← links)
- On input-revolving deterministic and nondeterministic finite automata (Q1041031) (← links)
- Remarks on multihead pushdown automata and multihead stack automata (Q1052822) (← links)
- A homomorphic characterization of recursively enumerable languages (Q1061494) (← links)
- Extended macro grammars and stack controlled machines (Q1064075) (← links)
- Grammars, derivation modes and properties of indexed and type-0 languages (Q1098316) (← links)
- The Dyck language \(D_ 1^{'*}\) is not generated by any matrix grammar of finite index (Q1099632) (← links)
- Simulating two pushdown stores by one tape in \(O(n^{1.5}\,\sqrt{\log \,n})\) time (Q1113670) (← links)
- A grammatical characterization of alternating pushdown automata (Q1123637) (← links)
- Superdeterministic DPDAs: The method of accepting does affect decision problems (Q1132642) (← links)
- One-way weak-stack-counter automata (Q1137874) (← links)
- A note on decision problems for three-way two-dimensional finite automata (Q1149774) (← links)
- Iterated stack automata and complexity classes (Q1183602) (← links)
- 1-way stack automaton with jumps (Q1217778) (← links)
- Reversal-bounded multipushdown machines (Q1219160) (← links)
- Characterization theorems on abstract families of transducers (Q1230515) (← links)
- Finite automata with multiplication (Q1233317) (← links)
- Degree-languages: A new concept of acceptance (Q1236888) (← links)
- Control sets on context-free grammar forms (Q1238638) (← links)
- Stack languages and log n space (Q1250712) (← links)
- A note on cyclic closure operations (Q1254107) (← links)
- Some decision problems concerning sequential transducers and checking automata (Q1256855) (← links)
- Monadic recursion schemes: The effect of constants (Q1259576) (← links)
- Pushdown cellular automata (Q1285588) (← links)
- Petri net algorithms in the theory of matrix grammars (Q1342504) (← links)
- Somewhat finite approaches to infinite sentences. (Q1353892) (← links)
- The equivalence of stack-counter acceptors and quasi-realtime stack- counter acceptors (Q1393121) (← links)
- A note on self-modifying finite automata (Q1583051) (← links)
- Homomorphic characterizations of recursively enumerable languages with very small language classes (Q1589418) (← links)
- Prediction of infinite words with automata (Q1635815) (← links)
- Accepting runs in a two-way finite automaton (Q1753992) (← links)
- On store languages of language acceptors (Q1786598) (← links)
- Context free normal systems and ETOL systems (Q1837541) (← links)
- Theory of formal grammars (Q1846334) (← links)
- Alternating and empty alternating auxiliary stack automata. (Q1874397) (← links)
- Principal abstract families of weighted tree languages (Q2064529) (← links)
- Visit-bounded stack automata (Q2163998) (← links)
- Removing nondeterminism in constant height pushdown automata (Q2252532) (← links)
- Deterministic input-driven queue automata: finite turns, decidability, and closure properties (Q2344746) (← links)
- On store languages and applications (Q2417850) (← links)
- Deep pushdown automata (Q2491213) (← links)
- Deterministic stack automata and the quotient operator (Q2531282) (← links)
- Checking automata and one-way stack languages (Q2532393) (← links)
- Scattered context grammars (Q2532394) (← links)
- What makes some language theory problems undecidable (Q2540268) (← links)
- Finite-turn checking automata (Q2550634) (← links)
- Absolutely parallel grammars and two-way finite-state transducers (Q2555753) (← links)
