On the Inclusion Problem for Finitely Ambiguous Rational Trace Languages

In this work we prove that the Inclusion is decidable for a particular class of trace languages that is the class R FIN (Σ, C) of finitely rational trace languages over an alphabet Σ = A ∪ B with the commutation relation C = (A x Σ ∪ Σ x A)\I.

[1]  Henry C. Thacher,et al.  Applied and Computational Complex Analysis. , 1988 .

[2]  Wojciech Rytter,et al.  On the Decidability of Some Problems about Rational Subsets of Free Partially Commutative Monoids , 1986, Theor. Comput. Sci..

[3]  Yves Métivier,et al.  Partial Commutation and Traces , 1997, Handbook of Formal Languages.

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

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

[6]  Oscar H. Ibarra,et al.  Reversal-Bounded Multicounter Machines and Their Decision Problems , 1978, JACM.

[7]  Alberto Bertoni,et al.  Holonomic Generating Functions and Context Free Languages , 1992, Int. J. Found. Comput. Sci..

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

[9]  Marcel Paul Schützenberger,et al.  On the Definition of a Family of Automata , 1961, Inf. Control..

[10]  D. Zeilberger.  A holonomic systems approach to special functions identities , 1990 .

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

[12]  Alberto Bertoni,et al.  A Parallel Algorithm for the Hadamard Product of Holonomic Formal Series , 1994, Int. J. Algebra Comput..

[13]  Jean Berstel,et al.  Rational series and their languages , 1988, EATCS monographs on theoretical computer science.

[14]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[15]  Arto Salomaa,et al.  Automata-Theoretic Aspects of Formal Power Series , 1978, Texts and Monographs in Computer Science.

[16]  L. Lipshitz,et al.  D-finite power series , 1989 .

[17]  Giancarlo Mauri,et al.  Equivalence and Membership Problems for Regular Trace Languages , 1982, ICALP.

[18]  Harry Furstenberg,et al.  Algebraic functions over finite fields , 1967 .