The following pages link to (Q4258214):
Displaying 29 items.
- Controlled finite automata (Q404012) (← links)
- One-sided random context grammars (Q766166) (← links)
- Scattered context grammars that erase nonterminals in a generalized \(k\)-limited way (Q1006344) (← links)
- On the power of deep pushdown stacks (Q1037618) (← links)
- Feedback automata and their languages (Q1064078) (← links)
- Nonterminal complexity of one-sided random context grammars (Q2428495) (← links)
- Deep pushdown automata (Q2491213) (← links)
- Automata generated \(p\)-languages (Q2629838) (← links)
- Cayley Automatic Groups and Numerical Characteristics of Turing Transducers (Q2817373) (← links)
- Tree-controlled grammars with restrictions placed upon cuts and paths (Q2893941) (← links)
- (Q3098058) (← links)
- Stack-like and queue-like dynamics in recurrent neural networks (Q3375554) (← links)
- (Q3562979) (← links)
- (Q3835538) (← links)
- (Q3975648) (← links)
- (Q4029346) (← links)
- (Q4729731) (← links)
- Algebraic Theory of Automata and Languages (Q4826930) (← links)
- (Q4863695) (← links)
- (Q4988157) (← links)
- (Q5060236) (← links)
- Scattered Context Grammars with One Non-Context-Free Production are Computationally Complete (Q5164863) (← links)
- (Q5389836) (← links)
- (Q5446606) (← links)
- GENERATION OF LANGUAGES BY REWRITING SYSTEMS THAT RESEMBLE AUTOMATA (Q5493904) (← links)
- 200 Problems on Languages, Automata, and Computation (Q5872503) (← links)
- Automata Theory and Formal Languages (Q5882966) (← links)
- Implementation and Application of Automata (Q5897695) (← links)
- CD Grammar Systems with Two Propagating Scattered Context Components Characterize the Family of Context Sensitive Languages (Q6114872) (← links)
