Counting Minimal Symmetric Difference NFAs

DOI10.1007/978-3-642-37064-9_37MaRDI QIDQ4910480zbMATH OpenOpenAlexFDO

Authors Brink van der Merwe, Mark Farag, J. Geldenhuys

Publication date 18 March 2013

Published in Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-37064-9_37

zbMATH Keywords

nondeterminismsuccinctnessweighted automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Minimal DFA for symmetric difference NFA
• Symmetric difference NFA: the state of the art
• Implementation and Application of Automata
• MAGIC NUMBERS FOR SYMMETRIC DIFFERENCE NFAS
• Asymptotic enumeration of minimal automata
• Descriptional complexity of ambiguity in symmetric difference NFAs
• Syntactic Minimization Of Nondeterministic Finite Automata.
• Implementation and Application of Automata
• Minimal consistent DFA revisited
• Ambiguity and structural ambiguity of symmetric difference NFAs

Cited in

(6)

• Minimal DFA for symmetric difference NFA
• Succinct descriptions of regular languages with binary -NFAs
• Symmetric difference NFA: the state of the art
• Implementation and Application of Automata
• MAGIC NUMBERS FOR SYMMETRIC DIFFERENCE NFAS
• On binary circle plus operator \(\oplus\)-NFAs and succinct descriptions of regular languages

This page was built for publication: Counting Minimal Symmetric Difference NFAs

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