Solving trace equations using lexicographical normal forms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1256, Issue , 1997, Pages 336-346

  Diekert, Volker ^a   Matiyasevich, Yuri ^b   Muscholl, Anca ^a  

^a UNIVERSITY OF STUTTGART   (Germany)

^b STEKLOV MATHEMATICAL INSTITUTE   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COMMUTATION RELATION; DIRECT REDUCTION; EQUATION SYSTEMS; NEW RESULTS; NORMAL FORM; TRACE MONOID; WORD EQUATIONS;

AUTOMATA THEORY;

EID: 84950977553     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63165-8_190     Document Type: Conference Paper

References (15)

1. IJ. J. Aalbersberg and H. J. Hoogeboom. Characterizations of the decidability of some problems for regular trace languages. Mathematical Systems Theory, 22:1-19, 1989.
2. C. Alvarez and J. Gabarró. The parallel complexity of two problems on concurrency. Information Processing Letters, 38:61-70, 1991.
3. A. V. Anisimov and D. E. Knuth. Inhomogeneous sorting. International Journal of Computer and Information Sciences, 8:255-260, 1979.
4. P. Cartier and D. Foata. Problemes combinatoires de commutation et rearrangements. Number 85 in Lecture Notes in Mathematics. Springer, 1969.
5. C. Choffrut. Combinatorics in trace monoids I. In [7].
6. V. Diekert, Y. Matiyasevich, and A. Muscholl. Solving trace equations using lexicographical normal forms. Technical report, Universitat Stuttgart, Fakultat Informatik, Bericht 1997/01, 1997.
7. V. Diekert and G. Rozenberg, editors. The Book of Traces. World Scientific, Singapore, 1995.
8. C. Duboc. On some equations in free partially commutative monoids. Theoretical Computer Science, 46:159-174, 1986.
9. S. Eilenberg. Automata, Languages, and Machines, volume A. Academic Press, New York and London, 1974.
10. G. S. Makanin. The problem of solvability of equations in a free semigroup. Math. Sbornik, 103:147-236, 1977. English transl. in Math. USSR Sbornik 32 (1977).
11. Yu Matiyasevich. Reduction of trace equations to word equations, 1996. Talk given at the “Colloquium on Computability, Complexity, and Logic”, 5-6 Dec. 1996, Institut fur Informatik, Universitat Stuttgart, Germany.
12. Yu Matiyasevich. Some decision problems for traces. In S. Adian and A. Nerode, editors, Proc. of the Ąth International Symposium on Logical Foundations of Computer Science (LFCS'97), number 1234 in Lecture Notes in Computer Science, pages 248-257, 1997. Springer. Invited lecture. To appear.
13. A. Mazurkiewicz. Concurrent program schemes and their interpretations. DAIMI Rep. PB 78, Aachus University, Aarhus, 1977.
14. K. U. Schulz. Makanin's algorithm for word equations — Two improvements and a generalization. In K. U. Schulz, ed., Word Equations and Related Topics, number 572 in Lecture Notes in Computer Science, pp. 85-150, Springer, 1991.
15. H. Straubing. Finite automata, formal logic, and circuit complexity. Birkhauser, 1994.