Constraint satisfaction in logic programming
Constraint satisfaction in logic programming
Regular models of phonological rule systems
Computational Linguistics - Special issue on computational phonology
Automata, Languages, and Machines
Automata, Languages, and Machines
Block-Deterministic Regular Languages
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
WFSC: a new weighted finite state compiler
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
The generalization of generalized automata: expression automata
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
A class of rational n-WFSM auto-intersections
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Selected operations and applications of n-tape weighted finite-state machines
FSMNLP'09 Proceedings of the 8th international conference on Finite-state methods and natural language processing
Hi-index | 0.00 |
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.