Name
Abstract | ||
|---|---|---|
We present a new incremental algorithm for minimising deterministic finite automata. It runs in quadratic time for any practical
application and may be halted at any point, returning a partially minimised automaton. Hence, the algorithm may be applied
to a given automaton at the same time as it is processing a string for acceptance. We also include some experimental comparative
results.
|
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/978-3-642-18098-9_5 | RAIRO - Theor. Inf. and Applic. |
Keywords | Field | DocType |
experimental comparative result,deterministic finite automaton,incremental dfa minimisation,minimised automaton,new incremental algorithm,practical application,quadratic time,deterministic finite automata | Two-way deterministic finite automaton,Deterministic automaton,Nondeterministic finite automaton,Deterministic finite automaton,Powerset construction,Algorithm,DFA minimization,Timed automaton,Mathematics,ω-automaton | Journal |
Volume | Issue | ISSN |
48 | 2 | 0988-3754 |
Citations | PageRank | References |
1 | 0.38 | 4 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marco Almeida | 1 | 31 | 3.99 |
| Nelma Moreira | 2 | 180 | 33.98 |
| Rogério Reis | 3 | 140 | 25.74 |