Transductions computed by PC-systems of monotone deterministic restarting automata

Authors:
Norbert Hundeshagen;Friedrich Otto;Marcel Vollweiler
Affiliations:
Fachbereich Elektrotechnik/Informatik, Universität Kassel, Kassel, Germany;Fachbereich Elektrotechnik/Informatik, Universität Kassel, Kassel, Germany;Fachbereich Elektrotechnik/Informatik, Universität Kassel, Kassel, Germany
Venue:
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Year:
2010

Citing 6
Cited 1

On monotonic automata with a restart operation

Journal of Automata, Languages and Combinatorics
The theory of parsing, translation, and compiling

The theory of parsing, translation, and compiling
Church-Rosser Languages vs. UCFL

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
A grammar based approach to a grammar checking of free word order languages

COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
A Hierarchy of Monotone Deterministic Non-Forgetting Restarting Automata

Theory of Computing Systems
Modeling syntax of free word-order languages: dependency analysis by reduction

TSD'05 Proceedings of the 8th international conference on Text, Speech and Dialogue

Characterizing the rational functions by restarting transducers

LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We associate a transduction (that is, a binary relation) with the characteristic language of a restarting automaton, and we prove that in this way monotone deterministic restarting automata yield a characterization of pushdown transductions. Then we study the class of transductions that are computed by parallel communicating systems (PC-systems) of monotone deterministic restarting automata. We will see that this class includes all transductions that are computable.