MSO definable string transductions and two-way finite-state transducers
ACM Transactions on Computational Logic (TOCL)
A Query Language for XML Based on Graph Grammars
World Wide Web
Two-Way Finite State Transducers and Monadic Second-Order Logic
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Hyperedge Substitution in Basic Atom-Replacement Languages
ICGT '02 Proceedings of the First International Conference on Graph Transformation
Linear deterministic multi bottom-up tree transducers
Theoretical Computer Science
Finite graph automata for linear and boundary graph languages
Theoretical Computer Science
A graph grammars based framework for querying graph-like data
Data & Knowledge Engineering - Special issue: ER 2003
The equivalence problem for deterministic MSO tree transducers is decidable
Information Processing Letters
Theoretical Computer Science
Adaptive Star Grammars for Graph Models
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Second-Order Abstract Categorial Grammars as Hyperedge Replacement Grammars
Journal of Logic, Language and Information
From tree-based generators to delegation networks
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
An algebra for tree-based music generation
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
Adaptive star grammars and their languages
Theoretical Computer Science
Decidable logics combining heap structures and data
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Minimalist tree languages are closed under intersection with recognizable tree languages
LACL'11 Proceedings of the 6th international conference on Logical aspects of computational linguistics
Exact XML type checking in polynomial time
ICDT'07 Proceedings of the 11th international conference on Database Theory
Model-checking hierarchical structures
Journal of Computer and System Sciences
Fixpoint logics on hierarchical structures
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
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
Chomsky-Schützenberger-type characterization of multiple context-free languages
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Importing montagovian dynamics into minimalism
LACL'12 Proceedings of the 7th international conference on Logical Aspects of Computational Linguistics
Contextual hyperedge replacement
AGTIVE'11 Proceedings of the 4th international conference on Applications of Graph Transformations with Industrial Relevance
Hi-index | 0.00 |