It is decidable whether a monadic thue system is canonical over a regular set

1990 ◽  
Vol 23 (1) ◽  
pp. 245-254 ◽  
Author(s):  
Paliath Narendran
Keyword(s):  
Thue System

The word problem for semigroups with two generators

1949 ◽  
Vol 14 (2) ◽  
pp. 115-118 ◽  
Author(s):  
Marshall Hall
Keyword(s):  
Finite Number ◽  
Word Problem ◽  
Thue System

Emil Post has shown that the word problem for Thue systems is unsolvable. A Thue system is a system of strings of letters x1, x2, …, xr, where a string or word is either void or a succession of letters a1a2 … at with each ai some xi. We are given a finite number of pairs of strings Ai, Bii = 1, …, m. Operations in the Thue system consist of the replacements or “productions.”

Small Semi-Thue System Universal with Respect to the Termination Problem

2017 ◽  
Vol 154 (1-4) ◽  
pp. 177-184
Author(s):  
Vesa Halava ◽  
Yuri Matiyasevich ◽  
Reino Niskanen
Keyword(s):  
Thue System ◽  
Termination Problem

scholarly journals A finite thue system with decidable word problem and without equivalent finite canonical system

1985 ◽  
Vol 35 ◽  
pp. 337-344 ◽  
Author(s):  
Deepak Kapur ◽  
Paliath Narendran
Keyword(s):  
Word Problem ◽  
Canonical System ◽  
Thue System

The inclusion structure of partially lossy queue monoids and their trace submonoids

2018 ◽  
Vol 52 (1) ◽  
pp. 55-86 ◽  
Author(s):  
Chris Köcher ◽  
Dietrich Kuske ◽  
Olena Prianychnykova
Keyword(s):  
Direct Product ◽  
Partial Answer ◽  
Free Monoids ◽  
Thue System ◽  
Fifo Queue ◽  
Algebraic Properties ◽  
Inclusion Structure

We model the behavior of a lossy fifo-queue as a monoid of transformations that are induced by sequences of writing and reading. To have a common model for reliable and lossy queues, we split the alphabet of the queue into two parts: the forgettable letters and the letters that are transmitted reliably. We describe this monoid by means of a confluent and terminating semi-Thue system and then study some of the monoid’s algebraic properties. In particular, we characterize completely when one such monoid can be embedded into another as well as which trace monoids occur as submonoids. Surprisingly, these are precisely those trace monoids that embed into the direct product of two free monoids – which gives a partial answer to a question raised by Diekert et al. at STACS 1995.

A note on a special one-rule semi-Thue system

1985 ◽  
Vol 21 (3) ◽  
pp. 135-140 ◽  
Author(s):  
M. Jantzen
Keyword(s):  
Thue System

Über ein 2-Dimensionales Thue-System mit Zwei Regeln und Unentscheidbarem Wortproblem

1979 ◽  
Vol 25 (7-12) ◽  
pp. 179-192 ◽  
Author(s):  
Lctz Priese
Keyword(s):  
Thue System
Sign in / Sign up

Export Citation Format

Share Document