Economy of description for basic constructions on rational transductions

Authors:
Henning Bordihn;Markus Holzer;Martin Kutrib
Affiliations:
Institut für Informatik, Universität Potsdam, Potsdam, Germany;Institut für Informatik, Technische Universität München, Garching bei München, Germany;Institut für Informatik, Universität Giessen, Giessen, Germany
Venue:
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
Year:
2004

Citing 12
Cited 0

Compilers: principles, techniques, and tools

Compilers: principles, techniques, and tools
The equivalence problem for single-valued two-way transducers (on NPDTOL languages) is decidable

SIAM Journal on Computing
Economy of description for single-valued transducers

Information and Computation
Regular languages

Handbook of formal languages, vol. 1
Transforming a single-valued transducer into a Mealy machine

Journal of Computer and System Sciences
The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines

Journal of the ACM (JACM)
Minimization algorithms for sequential transducers

Theoretical Computer Science
State complexity of regular languages

Journal of Automata, Languages and Combinatorics
Automata, Languages, and Machines

Automata, Languages, and Machines
Sur les relations rationnelles

Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Models for Hybrid Systems: Automata, Topologies, Controllability, Observability

Hybrid Systems
Finite-state transducers in language and speech processing

Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The state complexities of basic constructions on rational transductions are investigated. Given rational transductions, described by rational transducers, and an operation thereon we consider the number of states that is sufficient and necessary in the worst case to describe the resulting transduction. In particular, tight bounds are shown for inversion, union, weak intersection, concatenation, reversal, homomorphism, and composition, i.e., for some of those operations under which rational transductions are closed.