FA minimisation heuristics for a class of finite languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2214, Issue , 2001, Pages 1-12

  Amilhastre, Jérôme ^a   Janssen, Philippe ^a   Vilarem, Marie Catherine ^a  

^a LIRMM   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BIPARTITE GRAPHS; COMPLEXITY RESULTS; COVERING PROBLEMS; FINITE LANGUAGES; MINIMISATION;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84974730838     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45526-4_1     Document Type: Conference Paper

References (12)

1. [AVJ98] J. Amilhastre, M. C. Vilarem, and P. Janssen. Complexity of minimum biclique cover and decomposition for bipartite domino-free graphs. Discrete Applied Mathematics, 86(2):125-144, September 1998.
2. [Bry86] R.E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, C(35-6):677-691, 1986.
3. [DWW98] J. Daciuk, W. Watson, and B.W. Watson. Incremental construction of minimal acyclic finite state automata and transducers. In Finite State Methods in Natural Language Processing, Ankara, Turkey, 1998.
4. [FH93] P.C. Fishburn and P.L. Hammer. Bipartite dimensions and bipartite degrees of graphs. Technical Report 76, DIMACS, June 1993. available at http://dimacs.rutgers.edu/TechnicalReports.
5. [JR93] Tao Jiang and B. Ravikumar. Minimal NFA Problems are hard. SIAM Journal of Computation, 22:1117-1141, December 1993.
6. [Kim74] J. Kim. State minimization of nondeterministic machines. Technical report, IBM Thomas J. Watson Res. Center, 1974. RC 4896.
7. [KW70] T. Kameda and P. Weiner. On the state minimization of nondeterministic finite automata. IEEE Trans. Comp., C(19):617-627, 1970.
8. [Mon74] U. Montanari. Networks of constraints: fundamental properties and applications to picture processing. Information Sciences, (7):95-132, 1974.
9. [MP95] O. Matz and A. Potthoff. Computing small nondeterministic finite automata. In A.Skou U.H. Engberg, K.G. Larsen, editor, Workshop on Tools and Algorithms for the Construction and Analysis of Systems, pages 74-88. BRICS Notes Series, May 1995.
10. [Orl77] J. Orlin. Containment in graph theory: Covering graphs with cliques. Nederl. Akad. Wetensch. Indag. Math., 39:211-218, 1977.
11. [Rev91] Dominique Revuz. Dictionnaires et Lexiques, méthodes et algorithmes. PhD thesis, Université Paris VII, Février 1991.
12. [Vem92] N. R. Vempaty. Solving constraint satisfaction problems using finite state automata. In American Association for Artificial Intelligence (AAAI’92), pages 453-458, San Jose, 1992.