Abstract
Finite complete replacement systems over free partially commutative monoids have a decidable word problem, and if these systems are weight-reducing, then the word problem is solvable in square time. It is unknown whether this time bound is optimal; but the restriction to semi-Thue systems or vector replacement systems yields linear time. In direction to close this gap we first give a global condition for trace replacement systems which insures a linear time bound, too; and we prove that this condition is decidable. Then we give a stronger but local condition which leads to the notion of cones and blockes which are certain traces. Trivial examples of cones and blocks are words and vectors respectively. We show that under a mild additional assumption we may decide the confluence of a noetherian trace replacement system if all left-hand sides are cones or blocks. (In general confluence is undecidable even for length-reducing systems.) Altogether we obtain a sufficient and computable condition such that the word problem of a trace replacement system is solvable in linear time.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
I.J. Aalbersberg and G. Rozenberg. Theory of traces. Theoret. Comput. Sci., 60:1–82, 1988.
R.V. Book and H.-N. Liu. Rewriting systems and word problems in a free partially commutative monoid. Inform. Proc. Letters, 26:29–32, 1987.
R. Book. Confluent and other types of Thue systems. J. Assoc. for Comp. Math., 29:171–182, 1982.
P. Cartier and D. Foata. Problèmes combinatoires de commutation et réarrangements. Number 85 in Lect. Notes in Math. 1969.
M. Clerbout and M. Latteux. Partial commutations and faithful rational transductions. Theoret. Comp. Sci., 35:241–254, 1985.
R. Cori and D. Perrin. Automates et commutations partielles. R.A.I.R.O.-Informatique Théorique, 19:21–32, 1985.
V. Diekert. On the Knuth-Bendix completion for concurrent processes. In Th. Ottmann, editor, Proc. of the 14th International Colloquium on Automata Languages and Programming, Karlsruhe 1987, (ICALP'87), number 267 in Lect. Notes in Comp. Sci., pages 42–53, 1987. to appear in a revised version in Theoret. Comp. Sci.
M.P. Flé and G. Roucairol. On the serializability of iterated transactions. In Proc. ACM SIGACT-SIGOPS, Symposium on Principles of Distr. Comp., pages 194–200, Ottawa 1982, 1982.
A. Mazurkiewicz. Trace theory. In W. Brauer et al., editors, Petri Nets, Applications and Relationship to other models of concurrency, number 255 in Lect. Notes in Comp. Sci., pages 279–324, 1987.
P. Narendran and F. Otto. Preperfectness is undecidable for Thue systems containing only length-reducing rules and a single commutation rule. Information Proc. Letters, 1988. to appear.
G.X. Viennot. Heaps of pieces I: Basic definitions and combinatorial lemmas. In G. Labelle et al., editors, Combinatoire énumérative, Proceedings, Montreal, Quebec 1985, number 1234 in Lect. Notes in Math., pages 321–350, 1986.
C. Wrathall. The word problem for free partially commutative groups. J. Symbolic Computation, 6:99–104, 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Diekert, V. (1989). Word problems over traces which are solvable in linear time. In: Monien, B., Cori, R. (eds) STACS 89. STACS 1989. Lecture Notes in Computer Science, vol 349. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028982
Download citation
DOI: https://doi.org/10.1007/BFb0028982
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50840-3
Online ISBN: 978-3-540-46098-5
eBook Packages: Springer Book Archive