Abstract
In this paper we study the complexity of algorithms for problems on free partially commutative monoids (f.p.c.m.). These monoids are widely studied in the literature and their properties are used in several research areas. The elements of a f.p.c.m. and its subsets are called traces and trace languages respectively.
We first present some probabilistic estimations of the number of prefixes of a trace. The proof technique is based on the analysis of the generating functions of particular languages and is related to classical combinatorial methods. Then, we apply these probabilistic results to the analysis of algorithms for problems on trace languages. In particular, we describe an algorithm for the Membership Problem of context-free trace languages and determine its time complexity both in the worst and in the average case, assuming that all the input strings of given length have the same probability. Moreover, we show that, with probability tending to 1, the time complexity of our algorithm has the same order of growth of its mean value. At last we emphasize the difference between worst case and average case behaviour on some general examples.
This research has been supported by Ministero della Pubblica Istruzione in the frame of the Project (40%) "Modelli e specifiche di sistemi concorrenti".
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
IJ.J. Aalbersberg and H.J. Hogeboom, Decision problems for regular trace languages, Proc. 14th I.C.A.L.P., Lecture Notes in Computer Science n.267 (Springer-Verlag, 1987), 251–259.
IJ.J. Aalbersberg and G. Rozenberg, Theory of traces, Tech. Rep. 86-16, Dep. of Comput. Sci., University of Leiden (The Netherlands), September 1986.
IJ.J. Aalbersberg and E. Welzl, Trace languages defined by regular string languages, R.A.I.R.O. Inform. Théor. et Applic. 20 (1986), 103–119.
A.V. Aho, J.E. Hopcroft and J.D. Ullman, The design and analysis of computer algorithms (Addison-Wesley, Reading, 1974).
F. Bender, Asymptotic methods in enumeration, S.I.A.M. Review 16 (1974), 485–515.
A. Bertoni, M. Goldwurm and N. Sabadini, Analysis of a class of algorithms for problems on trace languages, Proc. 4th A.A.E.C.C. Conference (Karlsruhe 23–26 September 1986), Lecture Notes in Computer Science n.307, (Springer-Verlag, 1988), 202–214.
A. Bertoni, G. Mauri and N. Sabadini, Equivalence and membership problems for regular trace languages, Proc. 9th I.C.A.L.P., Lecture Notes in Computer Science n.140 (Springer-Verlag, 1982), 61–71.
A. Bertoni, G. Mauri and N. Sabadini, Representation of the prefixes of a trace and membership problem for context-free trace languages, manuscript, presented at the Workshop on Free partially commutative monoids, Paris, 1985.
P. Cartier and D. Foata, Problèmes combinatoires de commutation et réarrangements, Lecture Notes in Mathematics n.85, Springer Berlin, 1969.
K.L. Chung, A course in probability theory, Harcourt, Brace & World, Inc., 1968.
D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic propagations, Proc. 19th A.C.M. Symp. on Theory of Comput. (1987), 1–6.
M.P. Delest and G. Viennot, Algebraic languages and polyominoes enumeration, Theoretical Computer Science 34 (1984), 169–206.
C. Duboc, Commutations dans les monoïdes libres: un cadre théorique pour l'étude du parallélism, These du Doctorat, Université de Rouen, March 1986.
J. R. Goldman, Formal languages and enumeration, J. Combinatorial Theory, Series A 24 (1978), 318–338.
M. Goldwurm, Probabilistic estimation of the number of prefixes of a trace, Tech. Rep. n. 29/88, Dip. Scienze dell'Inf., Università di Milano (Italy), July 1988.
G.H. Gonnet, Handbook of algorithms and data structures (Addison-Wesley, London, 1984).
M. Hofri, Probabilistic analysis of algorithms, Texts and Monographs in Computer Science (Springer-Verlag, New Jork, 1987).
J.E. Hopcroft and J.D. Ullman, Introduction to automata theory, languages and computation, (Addison-Wensley, Reading, 1979).
M. Karonski, A review of random graphs, Journal of Graph Theory 6 (1982), 349–389.
G. Lallement, Semigroups and combinatorial applications (J. Wiley and Sons, 1979).
E. Lukacs, Stochastic Convergence (Academic Press, New Jork, 1975).
A. Mazurkiewicz, Concurrent program schemes and their interpretations, DAIMI, PB 78, Aarhus University, 1977.
E. Ochmanski, Regular behaviour of concurrent systems, Bulletin of E.A.T.C.S. (October 1985), 56–67.
W. Rytter, Some properties of trace languages, Annales Soc. Math. Pol., Series IV: Fundamenta Informaticae VII.1 (1984), 117–127.
M. Szijàrtò, Trace languages and closure operations, Automata Theoretic Letters 1979/2, Dep. of Num. and Comp. Math., Eotvos Univ., Budapest 1979.
L.G. Valiant, General context-free recognition in less than cubic time, J. Comp. and System Sci. 10 (1975), 308–315.
G.X. Viennot, Heaps of pieces I: basic definitions and combinatorial lemmas, Proc. Colloque de Combinatoire Enumérative U.Q.A.M., Montréal, 1985.
W. Zielonka, Notes on asynchronous automata, R.A.I.R.O. Inform. Théor. 21 (1987), 99–135.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bertoni, A., Goldwurm, M. (1989). On the prefixes of a random trace and the membership problem for context-free trace languages. In: Huguet, L., Poli, A. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 1987. Lecture Notes in Computer Science, vol 356. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51082-6_68
Download citation
DOI: https://doi.org/10.1007/3-540-51082-6_68
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51082-6
Online ISBN: 978-3-540-46150-0
eBook Packages: Springer Book Archive