A class of rational n-WFSM auto-intersections

Authors:
André Kempe;Jean-Marc Champarnaud;Jason Eisner;Franck Guingne;Florent Nicart
Affiliations:
Grenoble Laboratory, Xerox Research Centre Europe, Meylan, France;PSI Laboratory, Université de Rouen, CNRS, Mont-Saint-Aignan, France;Computer Science Department, Johns Hopkins University, Baltimore, MD, United States;Grenoble Laboratory, Xerox Research Centre Europe, Meylan, France;Grenoble Laboratory, Xerox Research Centre Europe, Meylan, France
Venue:
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Year:
2005

Citing 13
Cited 2

Semirings, automata, languages

Semirings, automata, languages
The equivalence problem of multitape finite automata

Theoretical Computer Science
Synchronized rational relations of finite and infinite words

Theoretical Computer Science - Selected papers of the International Colloquium on Words, Languages and Combinatorics, Kyoto, Japan, August 1990
Regular models of phonological rule systems

Computational Linguistics - Special issue on computational phonology
Automata, Languages, and Machines

Automata, Languages, and Machines
A Rational Design for a Weighted Finite-State Transducer Library

WIA '97 Revised Papers from the Second International Workshop on Implementing Automata
Multitiered nonlinear morphology using multitape finite automata: a case study on Syriac and Arabic

Computational Linguistics - Special issue on finite-state methods in NLP
Nonconcatenative finite-state morphology

EACL '87 Proceedings of the third conference on European chapter of the Association for Computational Linguistics
Parameter estimation for probabilistic finite-state transducers

ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
On n-type finite state acceptors

SWCT '64 Proceedings of the 1964 Proceedings of the Fifth Annual Symposium on Switching Circuit Theory and Logical Design
Finite automata and their decision problems

IBM Journal of Research and Development
On relations defined by generalized finite automata

IBM Journal of Research and Development
Edit-distance of weighted automata

CIAA'02 Proceedings of the 7th 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
Multi-tape automata with symbol classes

CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

Weighted finite-state machines with n tapes describe n-ary rational string relations. The join n-ary relation is very important in applications. It is shown how to compute it via a more simple operation, the auto-intersection. Join and auto-intersection generally do not preserve rationality. We define a class of triples 〈A, i, j〉 such that the auto-intersection of the machine A on tapes i and j can be computed by a delay-based algorithm. We point out how to extend this class and hope that it is sufficient for many practical applications.