Similarity relations and cover automata
Jean-Marc Champarnaud; Franck Guingne; Georges Hansel
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (2005)
- Volume: 39, Issue: 1, page 115-123
- ISSN: 0988-3754
Access Full Article
top
Abstract
topHow to cite
topChamparnaud, Jean-Marc, Guingne, Franck, and Hansel, Georges. "Similarity relations and cover automata." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 39.1 (2005): 115-123. <http://eudml.org/doc/245723>.
@article{Champarnaud2005,
abstract = {Cover automata for finite languages have been much studied a few years ago. It turns out that a simple mathematical structure, namely similarity relations over a finite set of words, is underlying these studies. In the present work, we investigate in detail for themselves the properties of these relations beyond the scope of finite languages. New results with straightforward proofs are obtained in this generalized framework, and previous results concerning cover automata are obtained as immediate consequences.},
author = {Champarnaud, Jean-Marc, Guingne, Franck, Hansel, Georges},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {finite automata; cover automaton for a finite language; similarity relation},
language = {eng},
number = {1},
pages = {115-123},
publisher = {EDP-Sciences},
title = {Similarity relations and cover automata},
url = {http://eudml.org/doc/245723},
volume = {39},
year = {2005},
}
TY - JOUR
AU - Champarnaud, Jean-Marc
AU - Guingne, Franck
AU - Hansel, Georges
TI - Similarity relations and cover automata
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 2005
PB - EDP-Sciences
VL - 39
IS - 1
SP - 115
EP - 123
AB - Cover automata for finite languages have been much studied a few years ago. It turns out that a simple mathematical structure, namely similarity relations over a finite set of words, is underlying these studies. In the present work, we investigate in detail for themselves the properties of these relations beyond the scope of finite languages. New results with straightforward proofs are obtained in this generalized framework, and previous results concerning cover automata are obtained as immediate consequences.
LA - eng
KW - finite automata; cover automaton for a finite language; similarity relation
UR - http://eudml.org/doc/245723
ER -
References
top- [1] C. Câmpeanu, N. Sântean and S. Yu, Minimal Cover-automata for Finite Languages. Theor. Comput. Sci. 267 (2001) 3–16. Zbl0984.68099
- [2] C. Câmpeanu, A. Păun and S. Yu, An Efficient Algorithm for Constructing Minimal Cover Automata for Finite Languages. Int. J. Foundations Comput. Sci. 13-1 (2002) 99–113. Zbl1066.68062
- [3] C. Dwork and L. Stockmeyer, A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata. SIAM J. Comput. 19 (1990) 1011–1023. Zbl0711.68075
- [4] J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading MA (1979). Zbl0426.68001MR645539
- [5] J. Kaneps and R. Friedvalds, Running Time to Recognize Non-Regular Languages by 2-Way Probabilistic Automata, in ICALP’91. Lect. Notes Comput. Sci. 510 (1991) 174–185. Zbl0766.68098
- [6] H. Körner, A Time and Space Efficient Algorithm for Minimizing Cover Automata for Finite Languages. Int. J. Foundations Comput. Sci. 14 (2003) 1071–1086. Zbl1104.68061
- [7] N. Sântean, Towards a Minimal Representation for Finite Languages: Theory and Practice. Master Thesis, The University of Western Ontario (2000).
- [8] S. Yu, Regular Languages, in Handbook of Formal Languages, edited by G. Rozenberg and A. Salomaa. Springer, Berlin (1997). MR1469994
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.