Compact Normal Form for Regular Languages as Xor Automata
From MaRDI portal
Publication:3637338
DOI10.1007/978-3-642-02979-0_6zbMath1248.68314OpenAlexW62782445MaRDI QIDQ3637338
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
Related Items (5)
Descriptional Complexity of Non-Unary Self-Verifying Symmetric Difference Automata ⋮ Unnamed Item ⋮ The \(k\)-distinct language: parameterized automata constructions ⋮ Unary Self-verifying Symmetric Difference Automata ⋮ Ambiguity of Unary Symmetric Difference NFAs
Cites Work
- On binary circle plus operator \(\oplus\)-NFAs and succinct descriptions of regular languages
- Matrices de Hankel
- Linear Automaton Transformations
- On the definition of a family of automata
- Minimal NFA Problems are Hard
- Shift-register synthesis and BCH decoding
- On the State Minimization of Nondeterministic Finite Automata
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Compact Normal Form for Regular Languages as Xor Automata
