Monadic datalog and the expressive power of languages for web information extraction
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Some Regular Languages That Are Church-Rosser Congruential
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Automatic structures: overview and future directions
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Monadic datalog and the expressive power of languages for Web information extraction
Journal of the ACM (JACM)
State complexity of shuffle on trajectories
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
Decidability of trajectory-based equations
Theoretical Computer Science - Mathematical foundations of computer science 2004
Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
On the joint subword complexity of automatic sequences
Theoretical Computer Science
Deciding determinism of caterpillar expressions
Theoretical Computer Science
Deterministic caterpillar expressions
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
On the density of regular and context-free languages
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Representing real numbers in a generalized numeration system
Journal of Computer and System Sciences
Boolean algebras of regular languages
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Hairpin structures defined by DNA trajectories
DNA'06 Proceedings of the 12th international conference on DNA Computing
Deciding regularity of hairpin completions of regular languages in polynomial time
Information and Computation
Hi-index | 0.00 |