Abstract
In this paper we use results and techniques from the theory of rational power series to show that the complement of a one-letter stochastic language is stochastic, but that the family of stochastic languages is closed neither under union and intersection nor under product and homomorphism. We also give a condition on the poles of a rational one-variable power seriesr to ensure that the stochastic language defined byr and any cut-point is rational.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Bibliographie
B. Benzaghou, Algèbres de Hadamard,Bull. Soc. Math. France 98 (1970), 209–252.
J. Berstel, Sur les pôles et le quotient de Hadamard de séries N-rationnelles,C.R. Acad. Sci. Paris 272 (1971), Série A, 1079–1081 (voir aussi: Contribution à l'étude des propriétés arithmétiques des langages formels, Thèse Sc. Math., Univ. Paris VII, Paris, 1972).
S. Eilenberg,Automata, Languages and Machines, Academic Press, New York, à paraître.
M. Fliess, Formal languages and formal power series, Séminaire IRIA Logique et Automates, Le Chesnay, 1971, pp. 77–85.
M. Fliess, Sur certaines familles de séries formelles, Thèse Sc. Math., Univ. Paris VII, Paris, 1972.
M. Fliess, Séries rationnelles positives et processus stochastiques,Ann. Inst. H. Poincaré, Sect. B, à paraître. (Voir aussi: Automates stochastiques et séries rationnelles non commutatives,Automata, Languages and Programming (M. Nivat, ed.), North Holland, Amsterdam, 1973, pp. 397–411.)
G. H. Hardy etE. M. Wright,An Introduction to the Theory of Numbers, Clarendon Press, Oxford, 1938.
C. Lech, A note on recurring series,Arkiv Mat. 2 (1953), 417–421.
K. Mahler, On the Taylor coefficients of rational functions,Proc. Cambridge Philos. Soc. 52 (1956), 39–48.
Z. A. Melzak, Power series representing certain rational functions,Canadian J. Math. 12 (1960), 20–26.
M. Nasu etN. Honda, A context-free language which is not acceptable by a probabilistic automaton,Information and Control 18 (1971), 233–236.
A. Paz, Some aspects of probabilistic automata,Information and Control 9 (1966), 26–60.
M. P. Schützenberger, On the definition of a family of automata,Information and Control 4 (1961), 245–270.
M. P. Schützenberger, On a theorem of R. Jungen,Proc. Amer. Math. Soc. 13 (1962), 885–890.
M. P. Schützenberger, Parties rationnelles d'un monoïde libre, Actes Congrès Internat. Math. Nice (1970), vol. 3, pp. 281–282, Gauthier-Villars, Paris, 1971.
T. Skolem, Ein Verfahren zur Behandlung gewisser exponentialer Gleichungen und diophantischer Gleichungen, Comptes Rendus 8e Congrès Math. Scandin. Stockholm (1934), pp. 163–188, Lund, 1935.
P. Turakainen, On probabilistic automata and their generalizations,Annales Acad. Sci. Fennicae, Ser. A.I., no.429, 1968.
P. Turakainen, Generalized automata and stochastic languages,Proc. Amer. Math. Soc. 21 (1969), 303–309.
P. Turakainen, On languages represented in rational probabilistic automata,Annales Acad. Sci. Fennicae, Ser. A.I., no.439, 1969.
P. Turakainen, The family of stochastic languages is closed neither under catenation nor under homomorphism,Annal. Univ. Turku, Ser. A.I. no.133, 1970.
P. Turakainen, Some closure properties of the family of stochastic languages,Information and Control 18 (1971), 253–256.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Fliess, M. Propriétés booléennes des langages stochastiques. Math. Systems Theory 7, 353–359 (1973). https://doi.org/10.1007/BF01890611
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01890611