Ambiguity and structural ambiguity of symmetric difference NFAs

DOI10.1016/j.tcs.2013.04.019zbMath1359.68182OpenAlexW2012104236MaRDI QIDQ2453538

Lynette van Zijl, J. Geldenhuys, A. B. van der Merwe

Publication date: 10 June 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.04.019

zbMATH Keywords

ambiguitynondeterminism

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unambiguous finite automata over a unary alphabet
• Finite automata and unary languages
• Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation
• Ambiguity of Unary Symmetric Difference NFAs
• Pseudonoise sequences based on algebraic feedback shift registers
• On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite 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
• Structurally Unambiguous Finite Automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Ambiguity and structural ambiguity of symmetric difference NFAs