Potential Weaknesses of the Commutator Key Agreement Protocol Based on Braid Groups
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Regular expressions: new results and open problems
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
Cancellation and periodicity properties of iterated morphisms
Theoretical Computer Science
Regular expressions: new results and open problems
Journal of Automata, Languages and Combinatorics
Detecting palindromes, patterns and borders in regular languages
Information and Computation
Unambiguous finite automata over a unary alphabet
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
State complexity of operations on two-way deterministic finite automata over a unary alphabet
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Pairs of complementary unary languages with “balanced” nondeterministic automata
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Unambiguous finite automata over a unary alphabet
Information and Computation
State complexity of operations on two-way finite automata over a unary alphabet
Theoretical Computer Science
Filtrations of Formal Languages by Arithmetic Progressions
Fundamenta Informaticae
| Hi-index | 0.01 |