An Efficient Algorithm for Constructing Minimal Cover Automata for Finite Languages

@article{Cmpeanu2002AnEA,
  title={An Efficient Algorithm for Constructing Minimal Cover Automata for Finite Languages},
  author={Cezar C{\^a}mpeanu and Andrei Paun and Sheng Yu},
  journal={Int. J. Found. Comput. Sci.},
  year={2002},
  volume={13},
  pages={83-97}
}
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 given to transform a DFA that accepts a finite language to a minimal deterministic finite cover automaton (DFCA) with the time complexity 0(n), where n is the number of states of the given DFA. In this paper, we review the basic concept of cover automata and describe a new efficient transformation… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
20 Citations
10 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 10 references

Towards a Minimal Representation for Finite Languages: Theory and Practice, MSc Thesis, Department of Computer Science, The University of Western Ontario

  • N. Santean
  • 2000
Highly Influential
4 Excerpts

Finite Automata — Behavior and Synthesis

  • B. A. Trakhtenbrot, Ya.M. Barzdin
  • North-Holland/American Elsevier,
  • 1973
Highly Influential
3 Excerpts

and D

  • J.-M. Champarnau
  • Maurel, Automata Implementation, Third…
  • 1999
1 Excerpt

S

  • C. Campeanu, N. Santean
  • Yu, "Minimal Cover-Automata for Finite Languages…
  • 1998

and S

  • D. Woo
  • Yu, Automata Implementation, Second International…
  • 1998
1 Excerpt

Frievalds, "Running Time to Recognize Non-Regular Languages by 2-Way Probabilistic Automata", in ICALP'91

  • R. J. Kaneps
  • 1991
1 Excerpt

Similar Papers

Loading similar papers…