WIA
2009
Springer
13 years 9 months ago
2009
Springer
In this paper we consider the problem of minimization of deterministic finite automata (DFA) with reference to Hopcroft’s algorithm. Hopcroft’s algorithm has several degrees o...
WIA
2009
Springer
13 years 11 months ago
2009
Springer
Uniform random generators deliver a simple empirical means to estimate the average complexity of an algorithm. We present a general rejection algorithm that generates sequential le...
WIA
2009
Springer
13 years 11 months ago
2009
Springer
WIA
2009
Springer
13 years 11 months ago
2009
Springer
We continue our work [H. Gruber, M. Holzer: Provably shorter regular expressions from deterministic finite automata (extended ). In Proc. DLT, LNCS 5257, 2008] on the problem of ...
WIA
2009
Springer
13 years 11 months ago
2009
Springer
WIA
2009
Springer
13 years 11 months ago
2009
Springer
WIA
2009
Springer
13 years 11 months ago
2009
Springer
FAdo is an ongoing project which aims to provide a set of tools for symbolic manipulation of formal languages. To allow highlevel programming with complex data structures, easy pro...
WIA
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. State elimination is an intuitive and easy-to-implement algorithm that computes a regular expression from a finite-state automaton (FA). The size of a regular expression...
WIA
2009
Springer
13 years 11 months ago
2009
Springer
