论文信息 - Multi-tape Automata with Symbol Classes

Multi-tape Automata with Symbol Classes

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.

André Kempe | Tamás Gaál | Florent Nicart | Jean-Marc Champarnaud | Tibor Csáki

[1] Lauri Karttunen,et al. The Replace Operator , 1995, ACL.

[2] Derick Wood,et al. Block-Deterministic Regular Languages , 2001, ICTCS.

[3] André Kempe,et al. A Class of Rational n-WFSM Auto-intersections , 2005, CIAA.

[4] Kimmo Koskenniemi,et al. A General Computational Model for Word-Form Recognition and Production , 1984 .

[5] Gertjan van Noord,et al. Finite State Transducers with Predicates and Identities , 2001, Grammars.

[6] Samuel Eilenberg,et al. Automata, languages, and machines. A , 1974, Pure and applied mathematics.

[7] Derick Wood,et al. The generalization of generalized automata: expression automata , 2005, Int. J. Found. Comput. Sci..

[8] Lauri Karttunen,et al. Finite State Morphology , 2003, CSLI Studies in Computational Linguistics.

[9] Pascal Van Hentenryck. Constraint satisfaction in logic programming , 1989, Logic programming.

[10] André Kempe,et al. WFSC - A New Weighted Finite State Compiler , 2003, CIAA.

[11] Martin Kay,et al. Regular Models of Phonological Rule Systems , 1994, CL.

[12] Tamás Gaál. Extended Sequentialization of Transducers , 2000, CIAA.