Descriptional Complexity of Non-Unary Self-Verifying Symmetric Difference Automata
From MaRDI portal
Publication:6114871
DOI10.1142/s0129054122410076OpenAlexW4280585047MaRDI QIDQ6114871
Lynette van Zijl, Laurette Marais
Publication date: 15 August 2023
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054122410076
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal simulation of self-verifying automata by deterministic automata
- On binary circle plus operator \(\oplus\)-NFAs and succinct descriptions of regular languages
- State complexity of unary SV-XNFA with different acceptance conditions
- Unary Self-verifying Symmetric Difference Automata
- Minimal DFA for Symmetric Difference NFA
- Compact Normal Form for Regular Languages as Xor Automata
- An upper bound for transforming self-verifying automata into deterministic ones