Some applications and techniques for generating functions

In this paper we apply generating functions techniques to the problem of deciding whether two probabilistic finite state asynchronous automata define the same events. We prove that the problem can be solved by an efficient parallel algorithm, in particular showing that it is in the class DET. Furthermore, we develop some methods for studying properties of generating functions, in particular from the point of view of the algebricity.

[1]  Stephen A. Cook,et al.  A Taxonomy of Problems with Fast Parallel Algorithms , 1985, Inf. Control..

[2]  G. Lallement.  Semigroups and combinatorial applications , 1979 .

[3]  Arto Salomaa,et al.  Formal languages , 1973, Computer science classics.

[4]  Michael K. Molloy,et al.  On the integration of delay and throughput measures in distributed processing models , 1981 .

[5]  Hendrik Jan Hoogeboom,et al.  Decision Problems for Regular Trace Languages , 1987, ICALP.

[6]  R. Stanley,et al.  On the foundations of combinatorial theory. VI. The idea of generating function , 1972 .

[7]  A. R. Forsyth.  Theory of Differential Equations , 1961 .

[8]  T. Schneider.  Introduction aux nombres transcendants , 1959 .

[9]  Giancarlo Mauri,et al.  Unambiguous regular trace languages , 1985 .

[10]  Alberto Bertoni,et al.  Generating functions of trace languages , 1988, Bull. EATCS.

[11]  Noam Chomsky,et al.  The Algebraic Theory of Context-Free Languages* , 1963 .

[12]  Azaria Paz,et al.  Introduction to Probabilistic Automata , 1971 .

[13]  Wieslaw Zielonka,et al.  Notes on Finite Asynchronous Automata , 1987, RAIRO Theor. Informatics Appl..

[14]  Jay R. Goldman,et al.  Formal Languages and Enumeration , 1978, J. Comb. Theory, Ser. A.

[15]  Giancarlo Mauri,et al.  An Application of the Theory of Free Partially Commutative Monoids: Asymptotic Densities of Trace Languages , 1981, MFCS.

[16]  Nicoletta Sabadini,et al.  On the Existence of the Minimum Asynchronous Automaton and on Decision Problems for Unambiguous Regular Trace Languages , 1988, STACS.

[17]  A. Mazurkiewicz.  Concurrent Program Schemes and their Interpretations , 1977 .

[18]  Philippe Flajolet,et al.  Analytic Models and Ambiguity of Context-free Languages* , 2022 .