The following pages link to Alexander Meduna (Q385969):
Displaying 50 items.
- Uniform rewriting based on permutations (Q4208597) (← links)
- Prefix pushdown automata and their simplification (Q4254588) (← links)
- Middle quotients of linear languages (Q4254654) (← links)
- (Q4258214) (← links)
- (Q4269164) (← links)
- (Q4269394) (← links)
- (Q4299861) (← links)
- (Q4301686) (← links)
- (Q4318906) (← links)
- A formalization of sequential, parallel, and continuous rewriting (Q4323388) (← links)
- (Q4329003) (← links)
- Six-Nonterminal multi-sequential grammars characterize the family of recursively enumerable languages (Q4375397) (← links)
- (Q4436356) (← links)
- (Q4453198) (← links)
- Simultaneously One-Turn Two-Pushdown Automata (Q4464412) (← links)
- (Q4465341) (← links)
- Jumping Scattered Context Grammars (Q4595586) (← links)
- Modern Language Models and Computation (Q4596600) (← links)
- (Q4672908) (← links)
- (Q4793087) (← links)
- Descriptional Complexity Of Generalized Forbidding Grammars (Q4796491) (← links)
- (Q4799356) (← links)
- (Q4878717) (← links)
- One-sided forbidding grammars and selective substitution grammars (Q4903559) (← links)
- Rule-restricted Automaton-grammar transducers: Power and Linguistic Applications (Q4914823) (← links)
- FINITELY EXPANDABLE DEEP PDAs (Q4922677) (← links)
- JUMPING FINITE AUTOMATA (Q4923298) (← links)
- (Q4988157) (← links)
- (Q5016368) (← links)
- Multi-island finite automata and their even computation (Q5033235) (← links)
- (Q5146528) (← links)
- Scattered Context Grammars with One Non-Context-Free Production are Computationally Complete (Q5164863) (← links)
- (Q5189109) (← links)
- On double-jumping finite automata and their closure properties (Q5223615) (← links)
- A Variant of Pure Two-Dimensional Context-Free Grammars Generating Picture Languages (Q5246059) (← links)
- Left Random Context ET0L Grammars (Q5300616) (← links)
- (Q5306175) (← links)
- (Q5386133) (← links)
- (Q5389836) (← links)
- (Q5401642) (← links)
- Regulated Grammars and Automata (Q5406167) (← links)
- (Q5422559) (← links)
- Equivalent language models that closely simulate one another and their illustration in terms of<i>L</i>systems (Q5428704) (← links)
- Maximal and Minimal Scattered Context Rewriting (Q5444980) (← links)
- (Q5446606) (← links)
- (Q5474003) (← links)
- GENERATION OF LANGUAGES BY REWRITING SYSTEMS THAT RESEMBLE AUTOMATA (Q5493904) (← links)
- (Q5696195) (← links)
- (Q5703167) (← links)
- Grammars with Context Conditions and Their Applications (Q5706505) (← links)
