On Recognizable Languages in Divisibility Monoids
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Recognizable languages in divisibility monoids
Mathematical Structures in Computer Science
On the trace product and some families of languages closed under partial commutations
Journal of Automata, Languages and Combinatorics
On Star-Connected Flat Languages
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Recognizable languages in divisibility monoids
Mathematical Structures in Computer Science
On Star-Connected Flat Languages
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
| Hi-index | 5.23 |