On the inclusion problem for finitely ambiguous rational trace languages

Theoretical Informatics and Applications

Volumn 32, Issue 1-3, 1998, Pages 79-98

  Bertoni, A ^a   Massazza, P ^a  

^a UNIVERSITY OF MILAN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032385969     PISSN: 09883754     EISSN: 28047346     Source Type: Journal    
DOI: 10.1051/ita/1998321-300791     Document Type: Article

References (22)

1. I. J. J. AALBERSBERG, H. J. HOOGEBOOM, Characterizations of the decidability of some problems for regular trace languages, Mathematical Systems Theory, 22 (1989), p. 1-19.
2. J. BERSTEL, C. REUTENAUER, Rational series and their languages, Springer-Verlag, Berlin Heidelberg, 1988.
3. A. BERTONI, G. MAURI, N. SABADINI, Equivalence and membership problems for regular trace languages, Lectures Notes in Computer Sciences, 140 (1982), p. 61-72.
4. A. BERTONI, G. MAURI, N. SABADINI, Unambiguous regular trace languages, Proc. of the Coll. on Algebra, Combinatorics and Logic in Computer Science, Colloquia Mathematica Soc. J. Bolyay, North Holland, vol. 42 (1985), p. 113-123.
5. A. BERTONI, P. MASSAZZA, A Parallel Algorithm for the Hadamard Product of Holonomic Formal Series, International Journal of Algebra and Computation, vol. 4, no 4 (1994), p. 561-573.
6. A. BERTONI, P. MASSAZZA, N. SABADINI, Holonomic generating functions and context free languages, International Journal of Foundations of Computer Science, vol. 3, no 2 (1992), p. 181-191.
7. A. BERTONI, M. GOLDWURM, G. MAURI, N. SABADINI, Counting Techniques for Inclusion, Equivalence and Membership Problems, in The Book of Traces (V. Diekert, G. Rozemberg eds.), World Scientific (1995), p. 131-163.
8. N. CHOMSKY, M. P. SCHUETZENBERGER, The algebraic theory of context-free languages, Computer Programming and Formal Systems, North Holland, 1963, p. 118-161.
9. V. DIEKERT, Y. METIVIER, Partial Commutation and Traces, in Handbook of Formal Languages (G. Rozemberg, A. Salomaa eds.), vol. 3, Beyond Words, Springer (1997), p, 457-533.
10. P. FLAJOLET Analytic Models and Ambiguity of Context-Free Languages, Theoretical Computer Science, 49 (1987), p. 283-309.
11. H. FURSTENBERG, Algebraic functions over finite fields, Journal of Algebra, 7 (1967), p. 271-277.
12. M. R. GAREY, D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco, 1979.
13. A. GIBBONS, W. RYTTER, On the decidability of some problems about rational subsets of free partially commutative monoids, Theoretical Computer Science, 48 (1986), p. 329-337.
14. P. HENRICI, Applied and computational complex analysis, vol. 1, John Wiley Interscience, 1974.
15. O. H. IBARRA, Reversal-bounded multicounter machines and their decision problems, Journal of the Association of Computing Machinery, vol. 25 (1978). p. 116-133.
16. R. M. Karp, V. Ramachandran, Parallel Algorithms for Shared-Memory Machines, in Handbook of theoretical computer science, J. van Leeuwen ed., Elsevier (1990), p. 871-941.
17. L. LIPSHITZ, D-finite Power Series. Journal of Algebra, 122 (1989), p. 353-373.
18. A. MAZURKIEWICZ, Concurrent program schemes and their interpretations, DAIMI Rep. PB-78, Aarhus Univ., 1977.
19. A. SALOMAA, M. SOITTOLA, Automata-Theoretic Aspects of formal power series, Springer-Verlag, New York, 1978.
20. M. P. SCHUETZENBERGER, On the definition of a family of automata, Information and Control, 4 (1961), p. 245-270.
21. S. VARRICCHIO, On the decidability of the equivalence problem for partially commutative rational power series, LITP, Univ. Paris VII, Internal report 90.97, 1990.
22. D. ZEILBERGER, A holonomic systems approach to special functions identities, J. Comput. Appl. Math. 32 (1990), p. 321-368.