Algebraic tools for the concatenation product
Theoretical Computer Science
Decidable Hierarchies of Starfree Languages
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Partially-Ordered Two-Way Automata: A New Characterization of DA
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Level 5/2 of the Straubing-Thérien Hierarchy for Two-Letter Alphabets
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Some complexity results for polynomial rational expressions
Theoretical Computer Science
On the trace product and some families of languages closed under partial commutations
Journal of Automata, Languages and Combinatorics
Unresolved systems of language equations: expressive power and decision problems
Theoretical Computer Science
Languages polylog-time reducible to dot-depth 1/2
Journal of Computer and System Sciences
Tree Languages Defined in First-Order Logic with One Quantifier Alternation
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
The common fragment of ACTL and LTL
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Theme and variations on the concatenation product
CAI'11 Proceedings of the 4th international conference on Algebraic informatics
Polylog-time reductions decrease dot-depth
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Perfect correspondences between dot-depth and polynomial-time hierarchy
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
| Hi-index | 5.23 |