MSO definable string transductions and two-way finite-state transducers
ACM Transactions on Computational Logic (TOCL)
Rationality in algebras with a series operation
Information and Computation
Uniform and nonuniform recognizability
Theoretical Computer Science
Two-Way Finite State Transducers and Monadic Second-Order Logic
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Recognizable Sets of N-Free Pomsets Are Monadically Axiomatizable
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Automata on Series-Parallel Biposets
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
The monadic second-order logic of graphs XIV: uniformly sparse graphs and edge set quantifications
Theoretical Computer Science
Towards a language theory for infinite N-free pomsets
Theoretical Computer Science
Journal of Automata, Languages and Combinatorics
On the logical definability of centrain graph and poset languages
Journal of Automata, Languages and Combinatorics
Recognizability, hypergraph operations, and logical types
Information and Computation
Weighted tree automata and weighted logics
Theoretical Computer Science
Recognizability, hypergraph operations, and logical types
Information and Computation
Finding your way in a forest: on different types of trees and their properties
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Logics for unranked trees: an overview
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Towards a characterization of order-invariant queries over tame structures
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Fixed-Parameter tractability of treewidth and pathwidth
The Multivariate Algorithmic Revolution and Beyond
Second position clitics and monadic second-order transduction
ATANLP '12 Proceedings of the Workshop on Applications of Tree Automata Techniques in Natural Language Processing
Satisfiability of CTL* with constraints
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
| Hi-index | 0.01 |