Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Lookahead hierarchies of restarting automata
Journal of Automata, Languages and Combinatorics - Special issue: selected papers of the second internaional workshop on Descriptional Complexity of Automata, Grammars and Related Structures (London, Ontario, Canada, July 27-29, 2000)
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
Finite-state transducers in language and speech processing
Computational Linguistics
Bimachines and structurally-reversed automata
Journal of Automata, Languages and Combinatorics
Succinct description of regular languages by weak restarting automata
Information and Computation
Monotonicity of restarting automata
Journal of Automata, Languages and Combinatorics
A Hierarchy of Monotone Deterministic Non-Forgetting Restarting Automata
Theory of Computing Systems
Transductions computed by PC-systems of monotone deterministic restarting automata
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Characterizing the regular languages by nonforgetting restarting automata
DLT'11 Proceedings of the 15th international conference on Developments in language theory
| Hi-index | 0.00 |
A restarting transducer is a restarting automaton that is equipped with an output function. Accordingly, restarting transducers compute binary relations, and deterministic restarting transducers compute functions. Here we characterize the rational functions and some of their proper subclasses by certain types of deterministic restarting transducers with window size one.