scientific article; zbMATH DE number 7444008

MaRDI QIDQ5016366zbMATHFDO

Authors Laurette Marais, Lynette van Zijl

Publication date 13 December 2021

Full work available at URL https://arxiv.org/abs/1708.06466

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Descriptional Complexity of Non-Unary Self-Verifying Symmetric Difference Automata
• Descriptional complexity of ambiguity in symmetric difference NFAs
• Self-verifying finite automata and descriptional complexity
• Unary Self-verifying Symmetric Difference Automata
• Descriptional Complexity of Nondeterministic Finite Automata
• Descriptional complexity of unambiguous input-driven pushdown automata
• Descriptional complexity of (un)ambiguous finite state machines and pushdown automata
• Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity
• NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY
• scientific article; zbMATH DE number 2068876

Cites work

• scientific article; zbMATH DE number 3458508 (Why is no real title available?)
• scientific article; zbMATH DE number 1773094 (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
• MAGIC NUMBERS FOR SYMMETRIC DIFFERENCE NFAS
• Minimal DFA for symmetric difference NFA
• Optimal simulation of self-verifying automata by deterministic automata
• State complexity of unary SV-XNFA with different acceptance conditions
• Unary Self-verifying Symmetric Difference Automata

Cited in

(9)

• State complexity of unary SV-XNFA with different acceptance conditions
• Converting Self-verifying Automata into Deterministic Automata
• Optimal simulation of self-verifying automata by deterministic automata
• An upper bound for transforming self-verifying automata into deterministic ones
• scientific article; zbMATH DE number 6351511 (Why is no real title available?)
• State complexity of GF(2)-operations on unary languages
• Descriptional Complexity of Non-Unary Self-Verifying Symmetric Difference Automata
• Self-verifying finite automata and descriptional complexity
• Unary Self-verifying Symmetric Difference Automata

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5016366)