Subset construction complexity for homogeneous automata, position automata and ZPC-structures
The aim of this paper is to investigate how subset construction performs on specific families of automata. A new upper bound on the number of states of the subset-automaton is established in the case of homogeneous automata. The complexity of the two basic steps of subset construction, i.e. the computation of deterministic transitions and the set equality tests, is examined depending on whether the nondeterministic automaton is an unrestricted one, an homogeneous one. a position one or a ZPC-structure, which is an implicit construction for a position automaton. (C) 2001 Elsevier Science B.V. All rights reserved.
subset construction zpc-structure position automaton homogeneous automaton position sets