Logical definability of some rational trace languages-Reference-Cited by-同舟云学术

Logical definability of some rational trace languages

Published:1995-09 Issue:5 Volume:28 Page:397-420
ISSN:0025-5661
Container-title:Mathematical Systems Theory
language:en
Short-container-title:Math. Systems Theory

Author:

Choffrut C.,Guerra L.

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science,Computational Theory and Mathematics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF01185864.pdf

Reference16 articles.

1. IJ. J. Aalbersberg and H. J. Hoogeboom. Characterizations of the Decidability of Some Problems for Regular Trace Languages.Math. Systems Theory, 20:1?19, 1989.

2. IJ. J. Aalsbersberg and G. Rozenberg. Theory of Traces.Theoret. Comput. Sci., 60:1?82, 1988.

3. IJ. J. Aalbersberg and E. Welz. Trace Languages Defined by Regular String Languages.RAIRO Inform. Théor. Appl., 20:103?119, 1986.

4. J. Berstel.Transductions and Context-Free Languages. Teubner, 1979.

5. A. Bertoni, G. Mauri, and N. Sabadini. Unambiguous Regular Trace Languages. In G. Katona, J. Demetrovics, and A. Salomaa, editors,Algebra, Combinatorics and Logic p. 249?260. Colloquia Mathematica Societatis János Bolyai, vol. 42. North-Holland, Amsterdam, 1985.

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

1. A Note on the Logical Definability of Rational Trace Languages;Fundamenta Informaticae;2012

2. From local to global temporal logics over Mazurkiewicz traces;Theoretical Computer Science;2006-05

3. Languages, Automata, and Logic;Handbook of Formal Languages;1997

4. Generalized rational relations and their logical definability;Fundamentals of Computation Theory;1997