Author:
Chytil Michal P.,Jákl Vojtěch
Publisher
Springer Berlin Heidelberg
Reference8 articles.
1. J.E. Hopcroft and J.D. Ullman, An Approach to a Unified Theory of Automata, The Bell System Technical Journal 46 (1967), 1793–1829.
2. A.V. Aho, J.E. Hopcroft and J.D. Ullman, A General Theory of Translation, Mathematical Systems Theory 3 (1969), 193–221.
3. J.E. Hopcroft and J.D. Ullman, Formal Languages and Their Relation to Automata, Addison-Wesley 1969
4. A.V. Aho and J.D. Ullman, A Characterization of Two-Way Deterministic Classes of Languages, JCSS 4 (1970), 523–538.
5. V. Rajlich, Bounded-Crossing Transducers, Information and Control 27 (1975), 329–335.
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Polyregular Functions Characterisations and Refutations;Lecture Notes in Computer Science;2024
2. Pebble minimization: the last theorems;Lecture Notes in Computer Science;2023
3. First-order tree-to-tree functions;Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science;2020-07-08
4. Modular Descriptions of Regular Functions;Algebraic Informatics;2019
5. Aperiodic String Transducers;International Journal of Foundations of Computer Science;2018-08