On the intersection of the class of linear context-free languages and the class of single-reset languages

DOI10.1016/0020-0190(86)90114-6zbMath0631.68067OpenAlexW2089396050MaRDI QIDQ1094883

Klaus W. Wagner

Publication date: 1986

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(86)90114-6

zbMATH Keywords

context-free languagesingle-reset languagesingle-reversal machine

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

On the intersection of stacks and queues ⋮ Even linear simple matrix languages: formal language properties and grammatical inference.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Familles de langages fermées par crochet ouvert
• Reset machines
• Erasable context-free languages

This page was built for publication: On the intersection of the class of linear context-free languages and the class of single-reset languages