On the defect theorem and simplifiability
From MaRDI portal
Publication:1090421
DOI10.1007/BF02573193zbMath0621.20033MaRDI QIDQ1090421
Juhani Karhumäki, Tero J.Harju
Publication date: 1986
Published in: Semigroup Forum (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/134804
wordsendomorphismscongruencessystems of equationsEhrenfeucht conjecturedefect theoremF-semigroupsfinitely generated subsemigroups of free semigroupsfree envelopeunique factorization extension
General structure theory for semigroups (20M10) Free semigroups, generators and relations, word problems (20M05)
Related Items
Many aspects of defect theorems, A defect property of codes with unbounded delays, Primitive sets of words, A note on decidability questions on presentations of word semigroups, ON NON-PERIODIC SOLUTIONS OF INDEPENDENT SYSTEMS OF WORD EQUATIONS OVER THREE UNKNOWNS, Identities and transductions, Relativized codes, An algorithm for enumerating all infinite repetitions in a D0L-system, Compactness of systems of equations in semigroups, On the rank of the subsets of a free monoid, Deciding whether a finite set of words has rank at most two, On the deficit of a finite set of words, The intersection of \(3\)-maximal submonoids, Cumulative defect., A defect theorem for bi-infinite words., Multiple factorizations of words and defect effect
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on intersections of free submonoids of a free monoid
- Systems of equations over a free monoid and Ehrenfeucht's conjecture
- Some algorithms on the star operation applied to finite languages
- A proof of Ehrenfeucht's conjecture
- Sur le théorème du defaut
- Presentations et presentations simplifiables d'un monoide simplifiable
- Quelques constructions et algorithmes rélatifs aux sous-monoides d'un monoide libre
- Elementary homomorphisms and a solution of the DOL sequence equivalence problem
- On finitely generated subsemigroups of a free semigroup
- The intersection of free submonoids of a free monoid is free
- The decidability of the dol prefix problem
- Russian text(ignored)