On languages with a certain prefix property

DOI10.1007/BF01683274zbMATH Open0358.68107OpenAlexW2089233589MaRDI QIDQ4131045FDOQ4131045

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

• Title not available (Why is that?)
• An Infinite Hierarchy of Context-Free Languages
• Finite-Turn Pushdown Automata
• Checking automata and one-way stack languages
• Finite-turn checking automata
• On equal matrix languages
• Reversal-Bounded Acceptors and Intersections of Linear Languages
• A helpful result for proving inherent ambiguity

Cited In (4)

• Une note sur la propriété de préfixe
• On infinite words determined by L systems
• A new pumping lemma for indexed languages, with an application to infinite words
• Title not available (Why is that?)

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)