MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  A taxonomy of finite automata minimization

Download:
Download as a PDF | Download as a PS
by Bruce W. Watson
ftp://ftp.win.tue.nl/pub/techreports/pi/automata/taxonomy/2nd.edition/mintax.600dpi.ps.gz
Add To MetaCart

Abstract:

algorithms

Citations

1153 A Method of Programming – Dijkstra, Feijen - 1988
176 Introduction to Automata Theory – Hopcroft, Ullman - 1979
169 An n log n algorithm for minimizing states in a finite automaton – Hopcroft - 1971
141 Finite automata and their decision problems – Rabin, Scott - 1959
114 Derivatives of regular expressions – Brzozowski - 1964
112 Gedanken-experiments on sequential machines – Moore - 1956
43 Linear automaton transformations – NERODE - 1958
37 The Synthesis of Sequential Switching Circuits – Huffman - 1985
34 Canonical regular expressions and minimal state graphs for definite events – Brzozowski
15 A taxonomy of finite automata construction and minimization algorithms – Watson - 1993
10 Describing an algorithm by hopcroft – Gries - 1973
5 What Computing is All About – Snepscheut - 1993
4 On minimizing finite automata – Brauer - 1988
2 Finite automata and the representation of events," WADD – Myhill - 1957
2 On minimizing finite automata – Urbanek - 1989
1 Some algorithms to decide the equivalence of recursive types," Computing Science Note 91/31 – Eikelder, M - 1991
1 On dual automata," Kibernetika 2(1): 7--10 – Mirkin - 1966
1 Trace theory and VLSI design – Snepscheut - 1985
View or Download | Add to My Collection | Correct Errors