See this document in CiteSeerX!

A Note on Decidability Questions on Presentations of Word Semigroups  (Make Corrections)  (1 citation)
C. Choffrut, T. Harju, J. Karhumäki
Theoretical Computer Science



  Home/Search   Context   Related

 
View or download:
tucs.fi/Publications/techr...TR75.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  tucs.fi/Publications/techrepor... (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We apply automata-theoretic tools and some recently established compactness properties in the study of F-semigroups, that is, subsemigroups of free semigroups. With each F-semigroup we associate an F-presentation, which turns out to be finite for all finitely generated F-semigroups. Connections between F-presentations and ordinary presentations of semigroups are pointed out. It is also shown that it is undecidable whether two finitely generated F-semigroups satisfy a common relation in their... (Update)

Similar documents based on text:   More   All
0.6:   Some Open Problems in Combinatorics of Words and Related Areas - Karhumäki (2000)   (Correct)
0.4:   Many Aspects of Defect Theorems - Harju, Karhumäki   (Correct)
0.4:   Remarks on Generalized Post Correspondence Problem - Karhumäki, Krob (1996)   (Correct)

BibTeX entry:   (Update)

C. Choffrut, T. Harju, and J. Karhumaki. A note on decidability questions in presentations of word semigroups. Manuscript. http://citeseer.ist.psu.edu/530053.html   More

@article{ choffrut97note,
    author = "C. Choffrut and T. Harju and J. Karhum{\"a}ki",
    title = "A note on decidability questions on presentations of word semigroups",
    journal = "Theoretical Computer Science",
    volume = "183",
    number = "1",
    pages = "83--92",
    year = "1997",
    url = "citeseer.ist.psu.edu/530053.html" }
Citations (may not include all citations):
197   Transductions and Context-Free Languages (context) - Berstel - 1979
89   Theory of Codes (context) - Berstel, Perrin - 1986
82   Semigroups and Combinatorial Applications (context) - Lallement - 1979
40   Combinatorics of words - Choffrut, Karhumaki - 1996
39   An Introduction to Semigroup Theory (context) - Howie - 1976
11   A proof of Ehrenfeucht's Conjecture (context) - Albert, Lawrence - 1985
6   Impossibility of algorithms for recognizing some properties .. (context) - Markov - 1951
6   the defect theorem and simplifiability (context) - Harju, Karhumaki - 1986
5   The equivalence of infinite systems of equations in free gro.. (context) - Guba - 1986
4   Systems of equations over a free monoid and Ehrenfeucht's Co.. (context) - Karhumaki - 1983
3   equation g'en'erale de diagonalisation de deux monomorphisme.. (context) - Lecerf, de - 1963
2   On finitely generated subsemigroups of a free semigroup (context) - Markov
1   Sur le demi-groupe des endomorhismes d'une alg'ebre abstrait.. (context) - Dubreil - 1969
1   A simple undecidable problem: existential agreement of inver.. (context) - Karhumaki, Maon - 1986

Documents on the same site (http://www.tucs.fi/Publications/techreports/):   More
A Model of a Snorer's Upper Airway - Aittokallio, Gyllenberg, Polo (1999)   (Correct)
An Approach to Object-Orientation in Action Systems - Bonsangue, Kok, Sere (1997)   (Correct)
Linear Size Test Sets for Certain Commutative Languages - Holub, Kortelainen (2001)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC