Ambiguity of unary symmetric difference NFAs
From MaRDI portal
Publication:3105754
DOI10.1007/978-3-642-23283-1_17zbMATH Open1351.68145OpenAlexW2054446598MaRDI QIDQ3105754FDOQ3105754
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finite automata and unary languages
- On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata
- Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation
- Unambiguous finite automata over a unary alphabet
- Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata
- DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY
- MAGIC NUMBERS FOR SYMMETRIC DIFFERENCE NFAS
- Title not available (Why is that?)
- Title not available (Why is that?)
- Pseudonoise sequences based on algebraic feedback shift registers
- Descriptional complexity of ambiguity in symmetric difference NFAs
- Compact Normal Form for Regular Languages as Xor Automata
Cited In (6)
- State complexity of GF(2)-operations on unary languages
- Unambiguous finite automata over a unary alphabet
- Ambiguity and structural ambiguity of symmetric difference NFAs
- Implementation and Application of Automata
- MAGIC NUMBERS FOR 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)
