EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 32 / No 1-3 (1998) RAIRO-Theor. Inf. Appl., 32 1-3 (1998) 79-98 References
Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 32, Number 1-3, 1998
Page(s) 79 - 98
DOI https://doi.org/10.1051/ita/1998321-300791
Published online 01 February 2017
  1. 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. [MR: 992783] [Zbl: 0679.68132] [Google Scholar]
  2. 2. J. BERSTEL, C. REUTENAUER, Rational series and their languages, Springer-Verlag, Berlin Heidelberg, 1988. [MR: 971022] [Zbl: 0668.68005] [Google Scholar]
  3. 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. [MR: 675445] [Zbl: 0486.68079] [Google Scholar]
  4. 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. [MR: 875858] [Zbl: 0627.68060] [Google Scholar]
  5. 5. A. BERTONI, P. MASSAZZA, A Parallel Algorithm for the Hadamard Product of Holonomic Formal Series, International Journal of Algebra and Computation, vol. 4, n° 4 (1994), p. 561-573. [MR: 1313127] [Zbl: 0819.68070] [Google Scholar]
  6. 6. A. BERTONI, P. MASSAZZA, N. SABADINI, Holonomic generating functions and context free languages, International Journal of Foundations of Computer Science, vol. 3, n° 2 (1992), p. 181-191. [MR: 1183586] [Zbl: 0754.68064] [Google Scholar]
  7. 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. [MR: 1478997] [Google Scholar]
  8. 8. N. CHOMSKY, M. P. SCHUETZENBERGER, The algebraic theory of context-free languages, Computer Programming and Formal Systems, North Holland, 1963, p. 118-161. [MR: 152391] [Zbl: 0148.00804] [Google Scholar]
  9. 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. [MR: 1470025] [Google Scholar]
  10. 10. P. FLAJOLET, Analytic Models and Ambiguity of Context-Free Languages, Theoretical Computer Science, 49 (1987), p. 283-309. [MR: 909335] [Zbl: 0612.68069] [Google Scholar]
  11. 11. H. FURSTENBERG, Algebraic functions over finite fields, Journal of Algebra, 7 (1967), p. 271-277. [MR: 215820] [Zbl: 0175.03903] [Google Scholar]
  12. 12. M. R. GAREY, D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco, 1979. [MR: 519066] [Zbl: 0411.68039] [Google Scholar]
  13. 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. [MR: 895803] [Zbl: 0638.68084] [Google Scholar]
  14. 14. P. HENRICI, Applied and computational complex analysis, vol. 1, John Wiley Interscience, 1974. [MR: 372162] [Zbl: 0313.30001] [Google Scholar]
  15. 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. [MR: 461988] [Zbl: 0365.68059] [Google Scholar]
  16. 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. [MR: 1127183] [Zbl: 0900.68267] [Google Scholar]
  17. 17. L. LIPSHITZ, D-finite Power Series, Journal of Algebra, 122 (1989), p. 353-373. [MR: 999079] [Zbl: 0695.12018] [Google Scholar]
  18. 18. A. MAZURKIEWICZ, Concurrent program schemes and their interpretations, DAIMI Rep. PB-78, Aarhus Univ., 1977. [Google Scholar]
  19. 19.A. SALOMAA, M. SOITTOLA, Automata-Theoretic Aspects of formal power series, Springer-Verlag, New York, 1978. [MR: 483721] [Zbl: 0377.68039] [Google Scholar]
  20. 20. M. P. SCHUETZENBERGER, On the definition of a family of automata, Information and Control, 4 (1961), p. 245-270. [MR: 135680] [Zbl: 0104.00702] [Google Scholar]
  21. 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. [Zbl: 0779.20038] [Google Scholar]
  22. 22. D. ZEILBERGER, A holonomic systems approach to special functions identities, J. Comput. Appl. Math. 32 (1990), p. 321-368. [MR: 1090884] [Zbl: 0738.33001] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.