Left quotients of deterministic context-free languages

DOI10.1007/978-3-032-01475-7_9MaRDI QIDQ6861880zbMATH OpenFDO

Authors Brennan Lockinger, Ian McQuillan

Publication date 10 February 2026

Full work available at URL https://doi.org/10.1007/978-3-032-01475-7_9

zbMATH Keywords

deterministic pushdown automataregular languagesdecision problemsclosure propertiesleft quotients

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3459894 (Why is no real title available?)
• scientific article; zbMATH DE number 3509706 (Why is no real title available?)
• A Note on Pushdown Store Automata and Regular Systems
• A pumping lemma for deterministic context-free languages
• Abstract families of deterministic languages
• Context-dependent nondeterminism for pushdown automata
• Deletion operations on deterministic families of automata
• Derivatives of Regular Expressions
• Deterministic context free languages
• Deterministic stack automata and the quotient operator
• Linear Automaton Transformations
• On store languages of language acceptors
• On the density of context-free and counter languages
• One way finite visit automata
• Quotient complexity of regular languages
• Regular Closure of Deterministic Languages
• Regulated nondeterminism in pushdown automata
• \(L(A)=L(B)\)? decidability results from complete formal systems

This page was built for publication: Left quotients of deterministic context-free languages

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