Ambiguity of unary symmetric difference NFAs

DOI10.1007/978-3-642-23283-1_17MaRDI QIDQ3105754zbMATH OpenOpenAlexFDO

Authors Brink van der Merwe, Lynette van Zijl, J. Geldenhuys

Publication date 6 January 2012

Published in Theoretical Aspects of Computing – ICTAC 2011 (Search for Journal in Brave)

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

zbMATH Keywords

ambiguitynondeterminism

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Ambiguity and structural ambiguity of symmetric difference NFAs
• Unambiguous finite automata over a unary alphabet
• Operations on Unambiguous Finite Automata
• Implementation and Application of Automata
• Unambiguous finite automata over a unary alphabet

Cites work

• scientific article; zbMATH DE number 5595151 (Why is no real title available?)
• scientific article; zbMATH DE number 54001 (Why is no real title available?)
• scientific article; zbMATH DE number 3458508 (Why is no real title available?)
• scientific article; zbMATH DE number 3634167 (Why is no real title available?)
• Compact Normal Form for Regular Languages as Xor Automata
• DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY
• Descriptional complexity of ambiguity in symmetric difference NFAs
• Finite automata and unary languages
• MAGIC NUMBERS FOR SYMMETRIC DIFFERENCE NFAS
• On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata
• Pseudonoise sequences based on algebraic feedback shift registers
• Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation
• Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata
• Unambiguous finite automata over a unary alphabet

Cited in

(6)

• Unambiguous finite automata over a unary alphabet
• State complexity of GF(2)-operations on unary languages
• MAGIC NUMBERS FOR SYMMETRIC DIFFERENCE NFAS
• Implementation and Application of Automata
• Ambiguity and structural ambiguity of symmetric difference NFAs
• Unary Self-verifying Symmetric Difference Automata

This page was built for publication: Ambiguity of unary symmetric difference NFAs

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