Control sets on linear grammars
From MaRDI portal
Publication:4053132
DOI10.1016/S0019-9958(74)90864-XzbMath0298.68059MaRDI QIDQ4053132
Publication date: 1974
Published in: Information and Control (Search for Journal in Brave)
Related Items (14)
The OI-hierarchy is closed under control ⋮ Unnamed Item ⋮ Tree transducers, L systems, and two-way machines ⋮ Multipass precedence analysis ⋮ HYBRID EXTENDED FINITE AUTOMATA ⋮ Weighted iterated linear control ⋮ Iterated linear control and iterated one-turn pushdowns ⋮ Basic tree transducers ⋮ Control sets on context-free grammar forms ⋮ One way finite visit automata ⋮ Gaining Power by Input Operations: Finite Automata and Beyond ⋮ Weighted parsing for grammar-based language models over multioperator monoids ⋮ On input-revolving deterministic and nondeterministic finite automata ⋮ Even linear simple matrix languages: formal language properties and grammatical inference.
This page was built for publication: Control sets on linear grammars
