Linear Context Free Languages

DOI10.1007/978-3-540-75292-9_24MaRDI QIDQ3525096zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Linear automata with translucent letters and linear context-free trace languages
• On linear languages recognized by deterministic biautomata
• A descriptive characterisation of linear languages
• Recognition of linear-slender context-free languages by real time one-way cellular automata
• Forgetting automata and contex-free languages

Cited in

(22)

• The Viterbi algorithm for subsets of stochastic context-free languages
• On linear languages recognized by deterministic biautomata
• Linear automata with translucent letters and linear context-free trace languages
• scientific article; zbMATH DE number 4035186 (Why is no real title available?)
• scientific article; zbMATH DE number 2150276 (Why is no real title available?)
• On two-sided locally testable languages
• On deterministic 1-limited 5' 3' sensing Watson-Crick finite-state transducers
• Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines
• Two-Sided Strictly Locally Testable Languages
• Grammatical Inference: Algorithms and Applications
• scientific article; zbMATH DE number 3230265 (Why is no real title available?)
• Recognizing picture languages by reductions to string languages
• 5' 3' Watson-Crick automata languages-without sensing parameter
• Non-returning deterministic and nondeterministic finite automata with translucent letters
• Non-returning 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
• Quasi-deterministic finite one-head and two-head automata
• Centralized versions of jumping finite automata
• 5^ 3^ Watson-Crick automata accepting necklaces
• Derived linear systems of context-free grammars
• A descriptive characterisation of linear languages

This page was built for publication: Linear Context Free Languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3525096)