Handbook of theoretical computer science (vol. B)
AUTOMATE, a computing package for automata and finite semigroups
Journal of Symbolic Computation
Grail: a C++ library for automata and expressions
Journal of Symbolic Computation - Special issue on “algorithms: implementation, libraries and use”
Partial derivatives of regular expressions and finite automaton constructions
Theoretical Computer Science
Handbook of formal languages, vol. 1
An efficient null-free procedure for deciding regular language memebership
Theoretical Computer Science - Special issue on implementing automata
Theory of Computation: A Primer
Theory of Computation: A Primer
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
A New Quadratic Algorithm to Convert a Regular Expression into an Automaton
WIA '96 Revised Papers from the First International Workshop on Implementing Automata
Instruction Computation in Subset Construction
WIA '96 Revised Papers from the First International Workshop on Implementing Automata
Block-Deterministic Regular Languages
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Durations and parametric model-checking in timed automata
ACM Transactions on Computational Logic (TOCL)
From regular weighted expressions to finite automata
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Brute force determinization of NFAs by means of state covers
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Computing the follow automaton of an expression
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
| Hi-index | 5.23 |
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. Copyright 2001 Elsevier Science B.V.