Handbook of formal languages, vol. 1
Journal of the ACM (JACM)
Automata, Languages, and Machines
Automata, Languages, and Machines
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Iterated GSM Mappings: A Collapsing Hierarchy
Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
Finite-state transducers in language and speech processing
Computational Linguistics
The Mathematical Theory of Context-Free Languages
The Mathematical Theory of Context-Free Languages
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
Nondeterministic Bimachines and Rational Relations with Finite Codomain
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
On weakly ambiguous finite transducers
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Characterizing the rational functions by restarting transducers
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Nondeterministic Bimachines and Rational Relations with Finite Codomain
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Hi-index | 0.00 |
Although bimachines are not widely used in practice, they represent a central concept in the study of rational functions. Indeed, they are finite state machines specifically designed to implement rational word functions. Their modelling power is equal to that of single-valued finite transducers. From the theoretical point of view, bimachines reflect the decomposition of a rational function into a left and a right sequential function. In this paper we define three new types of bimachines, classified according to the scanning direction of their reading heads. Then we prove that these types of bimachines are equivalent to the classical one and for doing so, we define and use a new concept, of structurally-reversed automaton. Consequently, we prove that the scanning directions of bimachines are irrelevant from the point of view of their modelling power. This leads to a method of simulating a bimachine by a left sequential transducer (or generalized sequential machines - GSM for short). Indeed, a preprocessing of the input word allows sequential transducers to realize the full range of rational functions. Remarkably enough, we basically show that the so versatile functional transducers-nondeterministic and with λ-input transitions-can successfully be replaced by a simple deterministic setup: a "trimmer" coupled with a GSM. Intuitively, this fact proves that sequential functions are not much weaker than rational functions.