Two Families of Languages Related to ALGOL
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Indexed Grammars—An Extension of Context-Free Grammars
Journal of the ACM (JACM)
An extension of ALGOL-like languages
Communications of the ACM
A syntax directed compiler for ALGOL 60
Communications of the ACM
Translations on a context free grammar
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Transformations and translations from the point of view of generalized finite automata theory
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
The Mathematical Theory of Context-Free Languages
The Mathematical Theory of Context-Free Languages
Grammars with macro-like productions
SWAT '68 Proceedings of the 9th Annual Symposium on Switching and Automata Theory (swat 1968)
Automaton analogs of syntax directed translation schemata
SWAT '68 Proceedings of the 9th Annual Symposium on Switching and Automata Theory (swat 1968)
Syntax directed mappings of context Free languages
SWAT '68 Proceedings of the 9th Annual Symposium on Switching and Automata Theory (swat 1968)
Journal of Computer and System Sciences
The translation power of top-down tree-to-graph transducers
Journal of Computer and System Sciences
TREEBAG - a Short Presentation
AGTIVE '99 Proceedings of the International Workshop on Applications of Graph Transformations with Industrial Relevance
Relating Accumulative and Non-accumulative Functional Programs
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Exponential Output Size of Top-Down Tree Transducers
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Structured Document Transformations Based on XSL
DBPL '99 Revised Papers from the 7th International Workshop on Database Programming Languages: Research Issues in Structured and Semistructured Database Programming
Compositions of extended top-down tree transducers
Information and Computation
Multi-Return Macro Tree Transducers
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Tree-Series-to-Tree-Series Transformations
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Extended Multi Bottom-Up Tree Transducers
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Deciding equivalence of top--down XML transformations in polynomial time
Journal of Computer and System Sciences
Defining syntax-directed translations by tree bimorphisms
Theoretical Computer Science
Journal of Computer and System Sciences
Intercalation lemmas for tree transducer languages
Journal of Computer and System Sciences
Un théorème de duplication pour les forêts algébriques
Journal of Computer and System Sciences
Journal of Computer and System Sciences
A generalized approach to formal languages
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Proceedings of the forty-second ACM symposium on Theory of computing
A tree transducer model for synchronous tree-adjoining grammars
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Preservation of recognizability for synchronous tree substitution grammars
ATANLP '10 Proceedings of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing
Minimization of deterministic bottom-up tree transducers
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Input products for weighted extended top-down tree transducers
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Compositions of top-down tree transducers with ε-rules
FSMNLP'09 Proceedings of the 8th international conference on Finite-state methods and natural language processing
Tree transformations and dependencies
MOL'11 Proceedings of the 12th biennial conference on The mathematics of language
Tiburon: a weighted tree automata toolkit
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Does o-substitution preserve recognizability?
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
An overview of probabilistic tree transducers for natural language processing
CICLing'05 Proceedings of the 6th international conference on Computational Linguistics and Intelligent Text Processing
Relating tree series transducers and weighted tree automata
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
Survey: weighted extended top-down tree transducers part iii - composition
Algebraic Foundations in Computer Science
PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
Weighted Extended Tree Transducers
Fundamenta Informaticae
Survey: Weighted Extended Top-down Tree Transducers Part II—Application in Machine Translation
Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
Unidirectional derivation semantics for synchronous tree-adjoining grammars
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Composing extended top-down tree transducers
EACL '12 Proceedings of the 13th Conference of the European Chapter of the Association for Computational Linguistics
Every sensible extended top-down tree transducer is a multi bottom-up tree transducer
NAACL HLT '12 Proceedings of the 2012 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies
Preservation of recognizability for weighted linear extended top-down tree transducers
ATANLP '12 Proceedings of the Workshop on Applications of Tree Automata Techniques in Natural Language Processing
Semantic parsing with Bayesian tree transducers
ACL '12 Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Long Papers - Volume 1
Categorical views on computations on trees
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Hi-index | 0.00 |
The introduction of syntax directed translations and transformations into formallanguage theory presents a very interesting area with considerable promise of application to questions of syntax and semantics of programming languages. The concept of generalized sequential machine (gsm) mapping (already of importance in language theory) is developed here in its natural extension to trees (or expressions). That generalized concept of gsm mapping encompasses most of the previously defined concepts relating to translations and transformations.