scientific article; zbMATH DE number 7444008

zbMath1483.68175arXiv1708.06466MaRDI QIDQ5016366

Lynette van Zijl, Laurette Marais

Publication date: 13 December 2021

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

State complexity of GF(2)-operations on unary languages

Cites Work

• 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
• 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
• MAGIC NUMBERS FOR SYMMETRIC DIFFERENCE NFAS
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: