Linear Context Free Languages

DOI10.1007/978-3-540-75292-9_24zbMath1147.68560OpenAlexW1562252540MaRDI QIDQ3525096

Roussanka Loukanova

Publication date: 17 September 2008

Published in: Theoretical Aspects of Computing – ICTAC 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75292-9_24

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (13)

Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines ⋮ On linear languages recognized by deterministic biautomata ⋮ Unnamed Item ⋮ Unnamed Item ⋮ \(5'\rightarrow 3'\) Watson-Crick automata languages-without sensing parameter ⋮ Non-returning deterministic and nondeterministic finite automata with translucent letters ⋮ A survey on automata with translucent letters ⋮ State-deterministic Finite Automata with Translucent Letters and Finite Automata with Nondeterministically Translucent Letters ⋮ The Viterbi algorithm for subsets of stochastic context-free languages ⋮ Unnamed Item ⋮ Linear automata with translucent letters and linear context-free trace languages ⋮ Two-Sided Strictly Locally Testable Languages ⋮ On deterministic 1-limited 5′ → 3′ sensing Watson–Crick finite-state transducers

This page was built for publication: Linear Context Free Languages