An upper bound for transforming self-verifying automata into deterministic ones

  title={An upper bound for transforming self-verifying automata into deterministic ones},
  author={Ira Assent and Sebastian Seibert},
  journal={RAIRO Theor. Informatics Appl.},
This paper describes a modification of the power set construction for the transformation of self-verifying nondeterministic finite automata to deterministic ones. Using a set counting argument, the upper bound for this transformation can be lowered from 2 n to O(2 √n). 
Converting Self-verifying Automata into Deterministic Automata
The main result is the exact cost, in terms of the number of states, of a deterministic simulation of self-verifying automata from a descriptional complexity point of view.
Self-Verifying Finite Automata and Descriptional Complexity
The cost of simulation of self-verifying finite automata by deterministic finite automaton, and the complexity of basic regular operations on languages represented by self- Verifying finite Automata are discussed.
Operations on Self-Verifying Finite Automata
We investigate the complexity of regular operations on languages represented by self-verifying automata. We get the tight bounds for complement, intersection, union, difference, symmetric difference,
Unary Self-verifying Symmetric Difference Automata
It is shown that there is a family of languages which can always be represented non-trivially by unary SV-XNFA, giving an upper and lower bound for state complexity.
Descriptional Complexity of Non-Unary Self-Verifying Symmetric Difference Automata
It is shown that for a certain set of non-unary SV-XNFA, [Formula: see text] is a tight bound on the state complexity.
Generalised acceptance conditions for symmetric difference nondeterministic finite automata
Generalised Acceptance Conditions for Symmetric Difference Nondeterministic Finite Automata L. Marais Dissertation: PhD (Comp. Sci.) 2018 Symmetric difference nondeterministic finite state automata


On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata
  • F. R. Moore
  • Computer Science, Mathematics
    IEEE Transactions on Computers
  • 1971
The bounds on state-set size in the proofs of the equivalence between nondeterministic and deterministic finite automata and between two-way and one-way deterministic finite automata are considered.
Introduction to Automata Theory, Languages and Computation
On the Power of Las Vegas for One-Way Communication Complexity, OBDDs, and Finite Automata
The main goal of this paper is the comparison of the power of Las Vegas computation and deterministic respectively nondeterministic computation for the complexity measures of one-way communication, ordered binary decision diagrams, and finite automata.
A comparision of two types of finite automata
  • Problemy Kibernetiki
  • 1963