On the inclusion problem for finitely ambiguous rational trace languages-Reference-Cited by-同舟云学术

On the inclusion problem for finitely ambiguous rational trace languages

Published:1998 Issue:1-3 Volume:32 Page:79-98
ISSN:0988-3754
Container-title:RAIRO - Theoretical Informatics and Applications
language:
Short-container-title:RAIRO-Theor. Inf. Appl.

Author:

Bertoni A.,Massazza P.

Publisher

EDP Sciences

Subject

Computer Science Applications,General Mathematics,Software

Link

http://www.rairo-ita.org/10.1051/ita/1998321-300791/pdf

Reference22 articles.

1. 1. AALBERSBERG I. J. J., HOOGEBOOM H. J., Characterizations of the decidability of some problems for regular trace languages, Mathematical Systems Theory, 22 (1989), p. 1-19.9927830679.68132

2. 2. BERSTEL J., REUTENAUER C., Rational series and their languages, Springer-Verlag, Berlin Heidelberg, 1988.9710220668.68005

3. 3. BERTONI A., MAURI G., SABADINI N., Equivalence and membership problems for regular trace languages, Lectures Notes in Computer Sciences, 140 (1982), p. 61-72.6754450486.68079

4. 4. BERTONI A., MAURI G., SABADINI N., 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.8758580627.68060

5. 5. BERTONI A., MASSAZZA P., 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.13131270819.68070

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Decision problems among the main subfamilies of rational relations;RAIRO - Theoretical Informatics and Applications;2006-04

2. Preface;RAIRO - Theoretical Informatics and Applications;2006-04

3. The Inclusion Problem for Unambiguous Rational Trace Languages;Developments in Language Theory;2005