Monadic Thue systems

Book, Ronald V.; Jantzen, Matthias; Wrathall, Celia

doi:10.1016/0304-3975(82)90036-6

Cited by 104 publications

(51 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is known that for every monadic semi-Thue system S over an alphabet Y and every rational subset R ⊆ Y * , R→ * S ∈ Rat(Y * ), see [BJW82,Sén94]. Taking R = L(A) and S = ST in this result, we obtain the first statement of Claim 34.…”

Section: L(d) = L(b)mentioning

confidence: 83%

See 1 more Smart Citation

Rational Subsets in HNN-Extensions and Amalgamated Products

Lohrey

Sénizergues

2008

Int. J. Algebra Comput.

View full text Add to dashboard Cite

show abstract

Section: L(d) = L(b)mentioning

confidence: 83%

“…Since the semi-Thue system S is monadic, both sets of descendants K → * S and K ′ → * S are rational subsets of X * [BJW82,Sén94]. Equality (B.1) thus shows that R ∩ R ′ is a rational subset of M.…”

Section: Appendix B Examples Of Monoidsmentioning

confidence: 94%

Rational Subsets in HNN-Extensions and Amalgamated Products

Lohrey

Sénizergues

2008

Int. J. Algebra Comput.

View full text Add to dashboard Cite

show abstract

“…If Tis monadic, then the language A$(R) is also regular [9]. However, if T is non-monadic, then this language is not necessarily regular.…”

Section: The Resultsmentioning

confidence: 99%

Commutativity in groups presented by finite Church-Rosser Thue systems

Madlener¹,

Otto²

1988

RAIRO-Theor. Inf. Appl.

View full text Add to dashboard Cite

“…On the other hand; string rewriting systems have been used very successfully to provide efficient algorithms for some decision problems for monoids and groups [4][5][6][7]21]. For example, if a group G can be presented by a finite Church-Rosser Thue system, then the word problem for G is decidable in linear time [4].…”

mentioning

confidence: 99%