Unambiguous constrained automata

DOI10.1007/978-3-642-31653-1_22MaRDI QIDQ3167499zbMATH OpenOpenAlexFDO

Authors Michaël Cadilhac, Pierre McKenzie, Alain Finkel

Publication date 2 November 2012

Published in Developments in Language Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-31653-1_22

zbMATH Keywords

unambiguityregularity testconstrained automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Unambiguous constrained automata
• Unambiguous Büchi automata.
• scientific article; zbMATH DE number 1512707
• On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
• scientific article; zbMATH DE number 4094825

Cited in

(7)

• Context-Freeness of Word-MIX Languages
• On the capacity of capacitated automata
• Bidimensional linear recursive sequences and universality of unambiguous register automata
• Unambiguous constrained automata
• The containment problem for unambiguous register automata
• scientific article; zbMATH DE number 4209587 (Why is no real title available?)
• Unambiguous automata

This page was built for publication: Unambiguous constrained automata

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