Pages that link to "Item:Q2544411"
From MaRDI portal
The following pages link to A hierarchy between context-free and context-sensitive languages (Q2544411):
Displaying 36 items.
- On state-alternating context-free grammars (Q557822) (← links)
- Computing by observing: simple systems and simple observers (Q616498) (← links)
- Left-forbidding cooperating distributed grammar systems (Q708220) (← links)
- An infinite hierarchy of language families generated by scattered context grammars with \(n\)-limited derivations (Q1019169) (← links)
- On the power of deep pushdown stacks (Q1037618) (← links)
- A note on Parikh maps, abstract languages, and decision problems (Q1065555) (← links)
- Shuffle on trajectories: Syntactic constraints (Q1128661) (← links)
- 2DST mappings of languages and related problems (Q1164438) (← links)
- Upper bounds on recognition of a hierarchy of non-context-free languages (Q1193884) (← links)
- A unified approach to the generation and the acception of formal languages (Q1241067) (← links)
- Fast recognition of context-sensitive structures (Q1258181) (← links)
- Multipass precedence analysis (Q1393278) (← links)
- Nonterminal complexity of programmed grammars. (Q1401269) (← links)
- Error tolerance for the recognition of faulty strings in a regulated grammar using fuzzy sets (Q1615413) (← links)
- Normal forms for context-sensitive grammars (Q1845477) (← links)
- Theory of formal grammars (Q1846334) (← links)
- Deep pushdown automata (Q2491213) (← links)
- AFL with the semilinear property (Q2552027) (← links)
- A note on leftmost restricted random context grammars (Q2560719) (← links)
- Some concepts for languages more powerful than context-free (Q2560720) (← links)
- One-Sided Random Context Grammars with Leftmost Derivations (Q3166950) (← links)
- Program Schemes with Deep Pushdown Storage (Q3507414) (← links)
- On Alternating Phrase-Structure Grammars (Q3540130) (← links)
- Iterated linear control and iterated one-turn pushdowns (Q3776663) (← links)
- On the generating power of regularly controlled bidirectional grammars (Q3979697) (← links)
- On coupled languages and translations (Q4131693) (← links)
- Size, index, and context-sensitivity of controlled partition grammars (Q4139706) (← links)
- The complexity of the membership problem for some extensions of context-free languagest† (Q4181980) (← links)
- An algebraic technique for context-sensitive parsing (Q4185837) (← links)
- Covering-languages of grammars (Q4769996) (← links)
- Pumping lemmas for the control language hierarchy (Q4835863) (← links)
- ON ALTERNATING PHRASE-STRUCTURE GRAMMARS (Q5187849) (← links)
- Fuzzy state grammar and fuzzy deep pushdown automaton (Q5273403) (← links)
- GENERATION OF LANGUAGES BY REWRITING SYSTEMS THAT RESEMBLE AUTOMATA (Q5493904) (← links)
- State grammars with stores (Q5919706) (← links)
- Locally finite languages (Q5941071) (← links)
