Unary Self-verifying Symmetric Difference Automata
From MaRDI portal
Publication:2829981
Recommendations
- Descriptional Complexity of Non-Unary Self-Verifying Symmetric Difference Automata
- scientific article; zbMATH DE number 7444008
- Structurally Unambiguous Finite Automata
- scientific article; zbMATH DE number 4094825
- Unambiguous automata
- Ambiguity of unary symmetric difference NFAs
- Unambiguous finite automata over a unary alphabet
- Unambiguous finite automata over a unary alphabet
- Some results on the structure of unary unambiguous automata
Cites work
- scientific article; zbMATH DE number 3458508 (Why is no real title available?)
- scientific article; zbMATH DE number 3634167 (Why is no real title available?)
- scientific article; zbMATH DE number 805390 (Why is no real title available?)
- scientific article; zbMATH DE number 1405658 (Why is no real title available?)
- An upper bound for transforming self-verifying automata into deterministic ones
- Compact Normal Form for Regular Languages as Xor Automata
- Minimal DFA for symmetric difference NFA
- Optimal simulation of self-verifying automata by deterministic automata
- Pairs of complementary unary languages with ``balanced nondeterministic automata
Cited in
(6)- State complexity of unary SV-XNFA with different acceptance conditions
- Symmetric difference NFA: the state of the art
- Optimal simulation of self-verifying automata by deterministic automata
- scientific article; zbMATH DE number 7444008 (Why is no real title available?)
- Descriptional Complexity of Non-Unary Self-Verifying Symmetric Difference Automata
- Self-verifying pushdown and queue automata
This page was built for publication: Unary Self-verifying Symmetric Difference Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829981)
