Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms

Autor:	Cătălin Ionuţ Tîrnăucă, Magnus Steinby
Rok vydání:	2007
Předmět:	Class (set theory) Syntax (programming languages) Computer science business.industry Computer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing) Composition (combinatorics) computer.software_genre Translation (geometry) Combinatorics Tree (descriptive set theory) TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES Tree structure Computer Science::Logic in Computer Science Artificial intelligence business computer Computer Science::Formal Languages and Automata Theory Natural language processing
Zdroj:	Implementation and Application of Automata ISBN: 9783540763352 CIAA
DOI:	10.1007/978-3-540-76336-9_25
Popis:	We introduce a class of tree bimorphisms that define exactly the translations performed by syntax-directed translation schemata. We also show that these "quasi-alphabetic" tree bimorphisms preserve recognizability, and that their class is closed under composition and inverses.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::27a1afa2fa649c92a9a7fb32827be3a7 https://doi.org/10.1007/978-3-540-76336-9_25 Zobrazit plný text záznamu