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

DOI10.1016/0020-0190(86)90114-6MaRDI QIDQ1094883zbMATH OpenOpenAlexFDO

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

Recommendations

• scientific article; zbMATH DE number 3961009
• On the intersection of stacks and queues
• One-reversal counter machines and multihead automata: revisited
• One-reversal counter machines and multihead automata: revisited
• On the conjecture \(\mathcal {L}_{\mathsf {DFCM}}\subsetneq \mathsf {RCM}\)

Cites work

• Erasable context-free languages
• Familles de langages fermées par crochet ouvert
• scientific article; zbMATH DE number 4035186 (Why is no real title available?)
• scientific article; zbMATH DE number 3677223 (Why is no real title available?)
• scientific article; zbMATH DE number 3723893 (Why is no real title available?)
• scientific article; zbMATH DE number 3509706 (Why is no real title available?)
• Reset machines

Cited in

(4)

• On the intersection of stacks and queues
• Even linear simple matrix languages: formal language properties and grammatical inference.
• Single-tape reset machines
• scientific article; zbMATH DE number 3961009 (Why is no real title available?)

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

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