Ambiguity and structural ambiguity of symmetric difference NFAs

DOI10.1016/J.TCS.2013.04.019MaRDI QIDQ2453538zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Ambiguity of unary symmetric difference NFAs
• Descriptional complexity of ambiguity in symmetric difference NFAs
• Unambiguous finite automata over a unary alphabet
• Implementation and Application of Automata
• MAGIC NUMBERS FOR SYMMETRIC DIFFERENCE NFAS

Cites work

• Ambiguity of unary symmetric difference NFAs
• Descriptional complexity of ambiguity in symmetric difference NFAs
• DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY
• Finite automata and unary languages
• 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?)
• 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
• On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and 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
• Structurally Unambiguous Finite Automata
• Unambiguous finite automata over a unary alphabet

Cited in

(5)

• scientific article; zbMATH DE number 1670710 (Why is no real title available?)
• Descriptional complexity of ambiguity in symmetric difference NFAs
• Ambiguity of unary symmetric difference NFAs
• Unambiguous finite automata over a unary alphabet
• Counting Minimal Symmetric Difference NFAs

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

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