Abstract
In a previous paper [BT 83], some probabilistic notions of density and waiting time for a formal language have been studied. We prove here that these probabilistic parameters are computable with an arbitrary precision for some families of languages : the languages with an end marker ; the prefix-free regular sets, with matricial algorithms on Markov chains related to deterministic finite-state automata ; at the end, the prefix-free languages of palindrom words, for which the use of counting generating series yields new results in the equally likely case, already studied in [BT 83], and allows to give partial answers in the general case.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J. Berstel. — "Sur la densité asymptotique des langages formels", in M. Nivat Ed., Automata, languages and Programming, North Holland P.C., Amsterdam (1973), pp. 345–358.
J. BERSTEL, editor. — "Séries formelles en variables non commutatives et applications", Actes de la 5° Ecole de Printemps d'Informatique Théorique, Vieux Boucau (1977), published by L.I.T.P. and E.N.S.T.A, Paris.
J. BERSTEL, D. PERRIN, M.P. SCHUTZENBERGER, — "Théorie des codes"— chap. VI (densités) L.I.T.P. report 84-5 and "The theory of codes" — Academic Press — To appear-
J. BEAUQUIER, L. THIMONIER. — "Formal languages and Bernouilli processes". L.I.T.P. report 83-30 — To appear in Colloquia Mathematica Societatis Janos Bolyai — (Hungary-September 1983).
J. BEAUQUIER. L. THIMONIER — "Formal languages, probabilities, paging and decoding algorithms"— L.I.T.P. report (to appear in 1984) — Submitted at the 25 th F.O.C.S. —I.E.E.E. (USA 1984)
Kai Lai CHUNG. — "Elementary probability theory with stochastic processes" — Springer Verlag, (1979)
P. FLAJOLET. — "Ambiguity and transcendence" — Proceedings of the 16th Annual Symposium on Theory of Computing (USA 1984)
M.A. HARRISON. — "Introduction to Formal language Theory"— Addison Wesley P.C. (1978)
G. Hansel, D. Perrin. — "Codes and Bernouilli Partitions" — Math. Systems Theory 16, 133–157 (1983).
P. HOEL, S. PORT, G. STONE. —"Introduction to stochastic processes" Houghton Mifflin Company ed. (1971).
L. Rade. — "The teaching of probability and statistics" proceedings of the 1st C.S.M.P. International Conference — Edited by L. Rade, Almqvist & Wiksell Forlag AB, Stockholm (1970).
R. SEDGEWICK. — "Mathematical Analysis of Combinatorial Algorithms" in G. LOUCHARD, G. LATOUCHE editors, Probability theory and computer science, Academic press 1983.
L. THIMONIER. — "A methodology for computing probabilistic parameters of formal languages: generating functions, non ambiguity and Dyck languages". —L.I.T.P. report (to appear in 1984) — Submitted at the 2nd Symposium on Theoretical Aspects of Computer Science (West Germany January 1985)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Beauquier, J., Thimonier, L. (1984). Computability of probabilistic parameters for some classes of formal languages. In: Chytil, M.P., Koubek, V. (eds) Mathematical Foundations of Computer Science 1984. MFCS 1984. Lecture Notes in Computer Science, vol 176. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030299
Download citation
DOI: https://doi.org/10.1007/BFb0030299
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13372-8
Online ISBN: 978-3-540-38929-3
eBook Packages: Springer Book Archive