Structurally Unambiguous Finite Automata

DOI10.1007/11812128_19zbMATH Open1160.68418OpenAlexW2106469501MaRDI QIDQ5757231FDOQ5757231

Authors: Hing-Man Leung 

Publication date: 6 September 2007

Published in: Implementation and Application of Automata (Search for Journal in Brave)

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

Recommendations

• Unambiguous finite automata over a unary alphabet
• Unambiguous finite automata over a unary alphabet
• Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation
• Operations on Unambiguous Finite Automata
• Operations on Unambiguous Finite Automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (10)

• Title not available (Why is that?)
• Finite Automata on Unranked and Unordered DAGs
• Ambiguity and structural ambiguity of symmetric difference NFAs
• Unambiguous Büchi automata.
• Structural Presburger digit vector automata
• A superpolynomial lower bound for the size of non-deterministic complement of an unambiguous automaton
• Unary Self-verifying Symmetric Difference Automata
• Computing the width of non-deterministic automata
• Unambiguity in automata theory
• Unambiguous automata

This page was built for publication: Structurally Unambiguous Finite Automata

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