Invited talk: automata theory for database theoreticians
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
An automata-theoretic approach to branching-time model checking
Journal of the ACM (JACM)
Generalized Definite Set Constraints
Constraints
One-visit caterpillar tree automata
Fundamenta Informaticae
Decidable Containment of Recursive Queries
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Two-Way Alternating Automata and Finite Models
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
XPath Containment in the Presence of Disjunction, DTDs, and Variables
ICDT '03 Proceedings of the 9th International Conference on Database Theory
The finite graph problem for two-way alternating automata
Theoretical Computer Science - Foundations of software science and computation structures
Decision procedures for inductive Boolean functions based on alternating automata
Theoretical Computer Science
Regular expression pattern matching for XML
Journal of Functional Programming
Decidable containment of recursive queries
Theoretical Computer Science - Database theory
Alternating two-way AC-tree automata
Information and Computation
XML transformation by tree-walking transducers with invisible pebbles
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Combining Equational Tree Automata over AC and ACI Theories
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
An Infinite Automaton Characterization of Double Exponential Time
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Pebble alternating tree-walking automata and their recognizing power
Acta Cybernetica
An Automata-Theoretic Approach to Regular XPath
DBPL '09 Proceedings of the 12th International Symposium on Database Programming Languages
Towards practical typechecking for macro tree transducers
DBPL'07 Proceedings of the 11th international conference on Database programming languages
Alternation in equational tree automata modulo XOR
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Finding finite herbrand models
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
One-Visit Caterpillar Tree Automata
Fundamenta Informaticae
| Hi-index | 5.23 |