On languages with a certain prefix property

DOI10.1007/BF01683274MaRDI QIDQ4131045zbMATH OpenOpenAlexFDO

Authors Ronald V. Book

Publication date 1977

Published in Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01683274

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• scientific article; zbMATH DE number 3246281 (Why is no real title available?)
• A helpful result for proving inherent ambiguity
• An Infinite Hierarchy of Context-Free Languages
• Checking automata and one-way stack languages
• Finite-Turn Pushdown Automata
• Finite-turn checking automata
• On equal matrix languages
• Reversal-Bounded Acceptors and Intersections of Linear Languages

Cited in

(4)

• On infinite words determined by L systems
• Une note sur la propriété de préfixe
• scientific article; zbMATH DE number 3602693 (Why is no real title available?)
• A new pumping lemma for indexed languages, with an application to infinite words

This page was built for publication: On languages with a certain prefix property

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