Compact Normal Form for Regular Languages as Xor Automata

DOI10.1007/978-3-642-02979-0_6MaRDI QIDQ3637338zbMATH OpenOpenAlexFDO

Authors Nicolas Gama, Jean E. Vuillemin

Publication date 9 July 2009

Published in Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02979-0_6

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Canonical nondeterministic automata
• Theory of átomata
• Theory of átomata
• Coalgebraic constructions of canonical nondeterministic automata
• Succinct representation of regular languages by Boolean automata. II

Cites work

• scientific article; zbMATH DE number 41838 (Why is no real title available?)
• scientific article; zbMATH DE number 2068873 (Why is no real title available?)
• scientific article; zbMATH DE number 1773093 (Why is no real title available?)
• Linear Automaton Transformations
• Matrices de Hankel
• Minimal NFA Problems are Hard
• On binary circle plus operator \(\oplus\)-NFAs and succinct descriptions of regular languages
• On the definition of a family of automata
• On the State Minimization of Nondeterministic Finite Automata
• Shift-register synthesis and BCH decoding

Cited in

(5)

• Unary Self-verifying Symmetric Difference Automata
• Ambiguity of unary symmetric difference NFAs
• scientific article; zbMATH DE number 7444008 (Why is no real title available?)
• The \(k\)-distinct language: parameterized automata constructions
• Descriptional Complexity of Non-Unary Self-Verifying Symmetric Difference Automata

This page was built for publication: Compact Normal Form for Regular Languages as Xor Automata

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