Extensions and submonoids of automatic monoids
Theoretical Computer Science
Divisibility Monoids: Presentation, Word Problem, and Rational Languages
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Decidable Theories of Cayley-Graphs
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Automatic structures: overview and future directions
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Automatic semigroups and categories
Theoretical Computer Science
Finite transducers for divisibility monoids
Theoretical Computer Science
A geometric characterization of automatic semigroups
Theoretical Computer Science
Automatic Presentations for Cancellative Semigroups
Language and Automata Theory and Applications
Theories of Automatic Structures and Their Complexity
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Automatic presentations for semigroups
Information and Computation
Theoretical Computer Science
Notions of hyperbolicity in monoids
Theoretical Computer Science
Generating series of the trace group
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Singular artin monoids of finite coxeter type are automatic
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Decidability and complexity in automatic monoids
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Where automatic structures benefit from weighted automata
Algebraic Foundations in Computer Science
Notions of hyperbolicity in monoids
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
| Hi-index | 5.23 |