Transformations and translations from the point of view of generalized finite automata theory
From MaRDI portal
Publication:5402511
DOI10.1145/800169.805427zbMath1282.68172OpenAlexW2046933493MaRDI QIDQ5402511
Publication date: 14 March 2014
Published in: Proceedings of the first annual ACM symposium on Theory of computing - STOC '69 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/800169.805427
Related Items (6)
Mappings and grammars on trees ⋮ Functionality of compositions of top-down tree transducers is decidable ⋮ Interdependent translation schemes ⋮ Pebble machines and tree walking machines ⋮ The HOM Problem is EXPTIME-Complete ⋮ Generalized sequential machine maps
This page was built for publication: Transformations and translations from the point of view of generalized finite automata theory