Abstract
Finite languages and finite subsequential functions can be represented by possibly cyclic finite machines, respectively called cover automata and cover transducers. In general, reduced cover machines have much fewer states than the corresponding minimal machines, yielding a compact representation for lexicons or dictionaries. We present here a new algorithm for reducing the number of states of an acyclic transducer.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Păun, A., Sântean, N., Yu, S.: An O(n 2) algorithm for constructing minimal cover automata for finite languages. In: Yu, S., Păun, A. (eds.) CIAA 2000. LNCS, vol. 2088, pp. 243–251. Springer, Heidelberg (2001)
Câmpeanu, C., Păun, A., Yu, S.: An efficient algorithm for constructing minimal cover automata for finite languages. Int. J. Found. Comput. Sci. 13, 83–97 (2002)
Kaneps, J., Freivalds, R.: Running time to recognize nonregular languages by 2-way probabilistic automata. In: Leach Albert, J., Monien, B., Rodríguez-Artalejo, M. (eds.) Automata, Languages and Programming. LNCS, vol. 510, pp. 174–185. Springer, Heidelberg (1991)
Dwork, C., Stockmeyer, L.: A time complexity gap for two-way probabilistic finite-state automata. SIAMJC 19, 1011–1023 (1990)
Champarnaud, J.M., Guingne, F., Hansel, G.: Similarity relations and cover automata. RAIRO Theoret. Informatics Appl. 39, 115–123 (2005)
Câmpeanu, C., Sântean, N., Yu, S.: Minimal cover-automata for finite languages. Theor. Comput. Sci. 267, 3–16 (2001)
Körner, H.: A time and space efficient algorithm for minimizing cover automata for finite languages. Int. J. Found. Comput. Sci. 14, 1071–1086 (2003)
Champarnaud, J.M., Guingne, F., Hansel, G.: Cover transducers for functions with finite domain. Int. J. Found. Comput. Sci. 16, 851–865 (2005)
Schützenberger, M.P.: Sur une variante des fonctions séquentielles. Theor. Comput. Sci. 4, 47–57 (1977)
Choffrut, C.: Contribution à l’étude de quelques familles remarquables de fonctions rationnelles. Thèse d’État, Université Paris 7, Mathématiques (1978)
Berstel, J.: Transductions and Context-Free Languages. vol. 38 of Leitfäden der angewandten Mathematik und Mechanik LAMM. Teubner (1979)
Choffrut, C.: Minimizing subsequential transducers: a survey. Theor. Comput. Sci. 292, 131–143 (2003)
Béal, M.P., Carton, O.: Computing the prefix of an automaton. RAIRO Theoret. Informatics Appl. 34, 503–514 (2000)
Mohri, M.: Minimization algorithms for sequential transducers. Theor. Comput. Sci. 234, 177–201 (2000)
Aho, A.V., Hopcroft, J.E., Ullman, J.D.: Data Structures and Algorithms. Addison-Wesley, Reading (1983)
Paige, R., Tarjan, R.E.: Three partition refinement algorithms. SIAM J. Comput. 16, 973–989 (1987)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Champarnaud, JM., Guingne, F., Farré, J. (2007). Reducing Acyclic Cover Transducers. In: Holub, J., Žďárek, J. (eds) Implementation and Application of Automata. CIAA 2007. Lecture Notes in Computer Science, vol 4783. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76336-9_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-76336-9_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-76335-2
Online ISBN: 978-3-540-76336-9
eBook Packages: Computer ScienceComputer Science (R0)