Unary Self-verifying Symmetric Difference Automata

DOI10.1007/978-3-319-41114-9_14zbMath1476.68134OpenAlexW2486953598MaRDI QIDQ2829981

Lynette van Zijl, Laurette Marais

Publication date: 9 November 2016

Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01633957/file/416473_1_En_14_Chapter.pdf

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Descriptional Complexity of Non-Unary Self-Verifying Symmetric Difference Automata ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal simulation of self-verifying automata by deterministic automata
• Pairs of complementary unary languages with ``balanced nondeterministic 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

This page was built for publication: Unary Self-verifying Symmetric Difference Automata