scientific article; zbMATH DE number 7444008
From MaRDI portal
Publication:5016366
zbMATH Open1483.68175arXiv1708.06466MaRDI QIDQ5016366FDOQ5016366
Authors: Laurette Marais, Lynette van Zijl 
Publication date: 13 December 2021
Full work available at URL: https://arxiv.org/abs/1708.06466
Title of this publication is not available (Why is that?)
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
- Optimal simulation of self-verifying automata by deterministic automata
- An upper bound for transforming self-verifying automata into deterministic ones
- Title not available (Why is that?)
- MAGIC NUMBERS FOR SYMMETRIC DIFFERENCE NFAS
- Title not available (Why is that?)
- Title not available (Why is that?)
- Minimal DFA for Symmetric Difference NFA
- State complexity of unary SV-XNFA with different acceptance conditions
- Unary Self-verifying Symmetric Difference Automata
- Compact Normal Form for Regular Languages as Xor Automata
Cited In (6)
- State complexity of GF(2)-operations on unary languages
- An upper bound for transforming self-verifying automata into deterministic ones
- Converting Self-verifying Automata into Deterministic Automata
- Optimal simulation of self-verifying automata by deterministic automata
- Title not available (Why is that?)
- 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)
