Residual Finite State Automata
Fundamenta Informaticae
On the State Minimization of Nondeterministic Finite Automata
IEEE Transactions on Computers
A note on the space complexity of some decision problems for finite automata
Information Processing Letters
Syntactic semiring and universal automaton
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Bideterministic automata and minimal representations of regular languages
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Learning Regular Languages Using Nondeterministic Finite Automata
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Universal automata and NFA learning
Theoretical Computer Science
| Hi-index | 0.00 |
In this contribution we shall see how our (algebraic) approach to the so-called universal automaton of a given regular language helps to understand the process of the minimalization of a NFA. The minimality is meant with respect to the number of states. Although it is known that the problem is PSPACE-complete (see [5]) one can propose algorithms of not too high complexities to compute relatively good approximations.