The homomorphism problem for the free monoid
Discrete Mathematics
On Recognizable Languages in Divisibility Monoids
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Divisibility Monoids: Presentation, Word Problem, and Rational Languages
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
The homomorphism problem for trace monoids
Theoretical Computer Science - WORDS
Recognizable languages in divisibility monoids
Mathematical Structures in Computer Science
Finite transducers for divisibility monoids
Theoretical Computer Science
Recognizable languages in divisibility monoids
Mathematical Structures in Computer Science
Theories of Automatic Structures and Their Complexity
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Semigroup automata with rational initial and terminal sets
Theoretical Computer Science
Algebraic characterization of the finite power property
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Rational transformations and a kleene theorem for power series over rational monoids
Algebraic Foundations in Computer Science
Where automatic structures benefit from weighted automata
Algebraic Foundations in Computer Science
Semigroups with a context-free word problem
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Hi-index | 0.00 |