Abstract
We will describe the recognizable formal power series over arbitrary semirings and in partially commuting variables, i.e. over trace monoids. We prove that the recognizable series are certain rational power series, which can be constructed from the polynomials by using the operations sum, product and a restricted star which is applied only to series for which the elements in the support all have the same connected alphabet. The converse is true if the underlying semi-ring is commutative. Moreover, if in addition the semiring is idempotent then the same result holds with a star restricted to series for which the elements in the support have connected (possibly different) alphabets. It is shown that these assumptions over the semiring are necessary. This provides a joint generalization of Kleene's. Schützenberger's and Ochmański's theorems.
This research was partly carried out during a stay of the first author in Paris and another stay of the second author in Dresden.
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. Theoretical Computer Science, 60:1–82, 1988.
J. Berstel and Ch. Reutenauer. Rational Series and Their Languages, volume 12 of EATCS Monographs in. Theoretical Computer Science. Springer Verlag, 1988.
Ch. Choffrut. Free partially commutative monoids. Rapport LITP 86.20. Université Paris 7 (France), 1986.
V. Diekert. Combinatorics on Traces. Number 454 in Lecture Notes in Computer Science. Springer Verlag, 1990.
V. Diekert and Y. Métivier. Partial commutation and traces. In G. Rozenberg and A. Salomaa, editors, Handbook on Formal Languages, volume III. Springer Verlag. To appear.
V. Diekert and G. Rozenberg, editors. Book of Traces. World Scientific, Singapore, 1995.
M. Fliess. Matrices de Hankel. J. Math. Pures et Appl., 53:197–224, 1974.
W. Kuich. Semirings and formal power series: Their relevance to formal languages and automata. In Handbook on Formal Languages. Springer Verlag, 1997. To appear.
W. Kuich and A. Salomaa. Semirings, Automata, Languages, volume 6 of EATCS Monographs in Theoretical Computer Science. Springer Verlag, 1986.
A. Mazurkiewicz. Concurrent program schemes and their interpretations. Tech. rep. DAIMI PB 78, Aarhus University, 1977.
A. Mazurkiewicz. Trace theory. In W. Brauer et al., editors, Advances in. Petri Nets'86, number 255 in Lecture Notes in Computer Science, pages 279–324. Springer Verlag, 1987.
E. Ochmański. Regular behaviour of concurrent systems. Bulletin of the European Association for Theoretical Computer Science (EATCS), 27:56–67, Oct 1985.
G. Pighizzini. Synthesis of nondeterministic asynchronous automata. In M. Droste and Y. Gurevich, editors, Semantics of Programming Languages and Model Theory, number 5 in Algebra, Logic and Applications, pages 109–126. Gordon and Breach Science Publ., 1993.
A. Salomaa and M. Soittola. Automata-Theoretic Aspects of Formal Power Series. Texts and Monographs in Computer Science. Springer Verlag, 1978.
M.P. Schützenberger. On the definition of a family of automata. Information and Control, 4:245–270, 1961.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Droste, M., Gastin, P. (1997). On recognizable and rational formal power series in partially commuting variables. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds) Automata, Languages and Programming. ICALP 1997. Lecture Notes in Computer Science, vol 1256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63165-8_222
Download citation
DOI: https://doi.org/10.1007/3-540-63165-8_222
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63165-1
Online ISBN: 978-3-540-69194-5
eBook Packages: Springer Book Archive