Intersection of Regular Languages and Star Hierarchy
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Describing syntax with star-free regular expressions
EACL '03 Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics - Volume 1
Cycle structure in automata and the holonomy decomposition
Acta Cybernetica
Fine hierarchies and m-reducibilities in theoretical computer science
Theoretical Computer Science
Complexity of Aperiodicity for Topological Properties of Regular ω-Languages
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Descriptional and Computational Complexity of Finite Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Regular tree languages definable in FO and in FOmod
ACM Transactions on Computational Logic (TOCL)
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
Descriptional and computational complexity of finite automata---A survey
Information and Computation
Theme and variations on the concatenation product
CAI'11 Proceedings of the 4th international conference on Algebraic informatics
Regular tree languages definable in FO
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
| Hi-index | 5.23 |