Ambiguity of Unary Symmetric Difference NFAs

DOI10.1007/978-3-642-23283-1_17zbMath1351.68145OpenAlexW2054446598MaRDI QIDQ3105754

Lynette van Zijl, Brink van der Merwe, 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)

Related Items (2)

Ambiguity and structural ambiguity of symmetric difference NFAs ⋮ State complexity of GF(2)-operations on unary languages

Cites Work

• Finite automata and unary languages
• Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation
• Pseudonoise sequences based on algebraic feedback shift registers
• Unambiguous Finite Automata over a Unary Alphabet
• Compact Normal Form for Regular Languages as Xor Automata
• Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata
• On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata
• DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY
• MAGIC NUMBERS FOR SYMMETRIC DIFFERENCE NFAS
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Ambiguity of Unary Symmetric Difference NFAs