论文信息 - An Efficient Algorithm for Constructing Minimal Cover Automata for Finite Languages

An Efficient Algorithm for Constructing Minimal Cover Automata for Finite Languages

The concept of cover automata for finite languages was formally introduced in [3]. Cover automata have been studied as an efficient representation of finite languages. In [3], an algorithm was give...

Andrei Paun | Sheng Yu | Cezar Câmpeanu

[1] Boris A. Trakhtenbrot,et al. Finite automata : behavior and synthesis , 1973 .

[2] David S. Johnson,et al. Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[3] Arto Salomaa,et al. On the decomposition of finite languages , 1999, Developments in Language Theory.

[4] Sheng Yu,et al. State Complexity of Regular Languages: Finite versus Infinite , 2000, Finite Versus Infinite.

[5] Cynthia Dwork,et al. A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata , 1990, SIAM J. Comput..