Syntax-Directed Semantics: Formal Models Based on Tree Transducers

Authors:
Zoltan Fulop;H. Vogler
Affiliations:
-;-
Venue:
Syntax-Directed Semantics: Formal Models Based on Tree Transducers
Year:
1998

Citing 0
Cited 53

The complexity of the exponential output size problem for top-down and bottom-up tree transducers

Information and Computation
Bottom-up and top-down tree series transformations

Journal of Automata, Languages and Combinatorics
Output string languages of compositions of deterministic macro tree transducers

Journal of Computer and System Sciences
Two-Way Finite State Transducers with Nested Pebbles

MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Characterizing and Deciding MSO-Definability of Macro Tree Transductions

STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
TREEBAG - a Short Presentation

AGTIVE '99 Proceedings of the International Workshop on Applications of Graph Transformations with Industrial Relevance
String Languages Generated by Total Deterministic Macro Tree Transducers

FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
The Complexity of Compositions of Deterministic Tree Transducers

FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
On Deforesting Parameters of Accumulating Maps

LOPSTR '01 Selected papers from the 11th International Workshop on Logic Based Program Synthesis and Transformation
Relating Accumulative and Non-accumulative Functional Programs

RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Conditions for Efficiency Improvement by Tree Transducer Composition

RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Hierarchies of String Languages Generated by Deterministic Tree Transducers

DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Exponential Output Size of Top-Down Tree Transducers

FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Syntactic composition of top-down tree transducers is short cut fusion

Mathematical Structures in Computer Science
Macro forest transducers

Information Processing Letters
Hierarchies of tree series transformations

Theoretical Computer Science
Branching synchronization grammars with nested tables

Journal of Computer and System Sciences
Weighted tree transducers

Journal of Automata, Languages and Combinatorics
XML type checking with macro tree transducers

Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Algebraic fusion of functions with an accumulating parameter and its improvement

Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming
Automata for XML---A survey

Journal of Computer and System Sciences
The equivalence problem for deterministic MSO tree transducers is decidable

Information Processing Letters
Incomparability results for classes of polynomial tree series transformations

Journal of Automata, Languages and Combinatorics
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
Pebble alternating tree-walking automata and their recognizing power

Acta Cybernetica
Bag Context Tree Grammars

Fundamenta Informaticae
Pebble Macro Tree Transducers with Strong Pebble Handling

Fundamenta Informaticae
Circularity, composition, and decomposition results for pebble macro tree transducers

Journal of Automata, Languages and Combinatorics
Algebraic fusion of functions with an accumulating parameter and its improvement

Journal of Functional Programming
Monadic Datalog Tree Transducers

LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
A Kleene Theorem for Forest Languages

LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Comments on complete sets of tree automata

DLT'03 Proceedings of the 7th international conference on Developments in language theory
Branching grammars: a generalization of ET0L systems

DLT'03 Proceedings of the 7th international conference on Developments in language theory
From tree-based generators to delegation networks

CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
Millstream systems: a formal model for linking language modules by interfaces

ATANLP '10 Proceedings of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing
Transforming lexica as trees

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
Symbolic finite state transducers: algorithms and applications

POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Computing transitive closures of hedge transformations

International Journal of Critical Computer-Based Systems
The equivalence problem for deterministic MSO tree transducers is decidable

FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
A grammar-based approach to invertible programs

ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
Wind in the willows – generating music by means of tree transducers

CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Macro tree transformations of linear size increase achieve cost-optimal parallelism

APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems
Computing transitive closures of hedge transformations

VECoS'07 Proceedings of the First international conference on Verification and Evaluation of Computer and Communication Systems
Symbolic tree transducers

PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
Weighted Extended Tree Transducers

Fundamenta Informaticae
Bag Context Tree Grammars

Fundamenta Informaticae
Pebble Macro Tree Transducers with Strong Pebble Handling

Fundamenta Informaticae
Modular tree automata

MPC'12 Proceedings of the 11th international conference on Mathematics of Program Construction
The grammatical approach: A syntax-directed declarative specification method for XML processing tasks

Computer Standards & Interfaces
FliPpr: a prettier invertible printing system

ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems
Equivalence of extended symbolic finite transducers

CAV'13 Proceedings of the 25th international conference on Computer Aided Verification

Quantified Score

Hi-index	0.00

Visualization

Abstract

From the Publisher:This is a motivated presentation of recent results on tree transducers, applied to studying the general properties of formal models and for providing semantics to context-free languages.