Modularization of regular growth automata

Authors:
Christian Wurm
Affiliations:
Universität Bielefeld CITEC Bielefeld
Venue:
FSMNLP '11 Proceedings of the 9th International Workshop on Finite State Methods and Natural Language Processing
Year:
2011

Citing 6
Cited 0

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
Fast context-free grammar parsing requires fast boolean matrix multiplication

Journal of the ACM (JACM)
Finite-state transducers in language and speech processing

Computational Linguistics
Strengths and weaknesses of finite-state technology: A case study in morphological grammar development

Natural Language Engineering
Synchronization of Regular Automata

MFCS '09 Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009
Regular growth automata: properties of a class of finitely induced infinite machines

MOL'11 Proceedings of the 12th biennial conference on The mathematics of language

Quantified Score

Hi-index	0.00

Visualization

Abstract

Regular growth automata form a class of infinite machines, in which all local computations are performed by finite state automata. We present some results which are relevant to application in practice; apart from runtime, the most important one is modularization, that is, abstraction over subroutines. We use the new techniques to prove some results on substitution.