Unary Self-verifying Symmetric Difference Automata

DOI10.1007/978-3-319-41114-9_14zbMATH Open1476.68134OpenAlexW2486953598MaRDI QIDQ2829981FDOQ2829981

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)

Cites Work

• Pairs of complementary unary languages with ``balanced nondeterministic automata
• Optimal simulation of self-verifying automata by deterministic automata
• An upper bound for transforming self-verifying automata into deterministic ones
• Minimal DFA for Symmetric Difference NFA
• Compact Normal Form for Regular Languages as Xor Automata
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

• Descriptional Complexity of Non-Unary Self-Verifying Symmetric Difference Automata
• Title not available (Why is that?)

   Recommendations

• Descriptional Complexity of Non-Unary Self-Verifying Symmetric Difference Automata 👍 👎
• Title not available (Why is that?) 👍 👎
• Structurally Unambiguous Finite Automata 👍 👎
• Title not available (Why is that?) 👍 👎
• 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 👍 👎

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)