Abstract
We propose a new model of finite state machine: multi-tape automata with symbol classes and identity and non-identity constraints (in short MASCIN). This model generalizes both classical single or multi-tape machines, and machines with extended alphabet. We define this model in terms of a constraint satisfaction problem and discuss a problem occurring when projection is used on the model. Finally, we describe its implementation and results of a performance test.
This is a preview of subscription content, log in via an institution to check access.
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
Beesley, K.R., Karttunen, L.: Finite State Morphology. CSLI Publications, Palo Alto (2003)
Eilenberg, S.: Automata, Languages, and Machines, vol. A. Academic Press, San Diego (1974)
Gaál, T.: Extended sequentializaton of transducers, pp. 569–585 (1999); Publicationes Mathematicae Debrecen, Supplement 60 (2002)
Gaál, T., Guingne, F., Nicart, F.: OTHER extension to finite state automata, vol. 65, pp. 535–552 (2002); Publicationes Mathematicae Debrecen, Supplement 65 (2005)
Giammarresi, D., Montalbano, R., Wood, D.: Block-deterministic regular languages. In: Restivo, A., Ronchi Della Rocca, S., Roversi, L. (eds.) ICTCS 2001. LNCS, vol. 2202, pp. 184–196. Springer, Heidelberg (2001)
Han, Y.-S., Wood, D.: The generalization of generalized automata: Expression automata. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds.) CIAA 2004. LNCS, vol. 3317, pp. 156–166. Springer, Heidelberg (2005)
Van Hentenryck, P.: Constraint satisfaction in logic programming. MIT Press, Cambridge (1989)
Kaplan, R.M., Kay, M.: Regular models of phonological rule systems. Computational Linguistics 20(3), 331–378 (1994)
Karttunen, L.: The replace operator. In: Proceedings of the 33rd Annual Meeting of the Association for Computational Linguistics, Boston, Massachusetts, pp. 16–23 (1995)
Kempe, A., Baeijs, C., Gaál, T., Guingne, F., Nicart, F.: WFSC - A new weighted finite state compiler. In: H. Ibarra, O., Dang, Z. (eds.) CIAA 2003. LNCS, vol. 2759, pp. 108–119. Springer, Heidelberg (2003)
Kempe, A., Champarnaud, J.-M., Eisner, J., Guingne, F., Nicart, F.: A class of rational n-WFSM auto-intersections. In: Farré, J., Litovsky, I., Schmitz, S. (eds.) CIAA 2005. LNCS, vol. 3845, pp. 188–198. Springer, Heidelberg (2006)
Koskenniemi, K.: Two-level Morphology: A General Computational Model for Word-Form Recognition and Production, PhD thesis at the University of Helsinki, Department of General Linguistics (1983)
Nicart, F.: Conception de modèles génériques pour les machines à états finis, Thèse de doctorat de l’Université de Rouen (2005)
van Noord, G., Gerdemann, D.: Finite state transducers with predicates and identities. Grammars 4(3), 263–286 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nicart, F., Champarnaud, J.M., Csáki, T., Gaál, T., Kempe, A. (2006). Multi-tape Automata with Symbol Classes. In: Ibarra, O.H., Yen, HC. (eds) Implementation and Application of Automata. CIAA 2006. Lecture Notes in Computer Science, vol 4094. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11812128_13
Download citation
DOI: https://doi.org/10.1007/11812128_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37213-4
Online ISBN: 978-3-540-37214-1
eBook Packages: Computer ScienceComputer Science (R0)