Automatic Monoids Versus Monoids with Finite Convergent Presentations

Authors:
Friedrich Otto;Andrea Sattler-Klein;Klaus Madlener
Affiliations:
-;-;-
Venue:
RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications
Year:
1998

On the Connections between Rewriting and Formal Language Theory

RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Undecidable properties of monoids with word problem solvable in linear time. Part II: cross sections and homological and homotopical finiteness conditions

Theoretical Computer Science
A geometric characterization of automatic semigroups

Theoretical Computer Science
Automatic Presentations for Cancellative Semigroups

Language and Automata Theory and Applications
Automatic presentations for semigroups

Information and Computation
Notions of hyperbolicity in monoids

Theoretical Computer Science
On s-regular preffix-rewriting systems and automatic structures

COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Singular artin monoids of finite coxeter type are automatic

LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Biautomatic semigroups

FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Notions of hyperbolicity in monoids

FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory

Hi-index	0.00