Asynchronous cellular automata for infinite traces-Reference-Cited by-同舟云学术

Asynchronous cellular automata for infinite traces

Published:1992 Issue: Volume: Page:583-594
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Gastin Paul,Petit Antoine

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-55719-9_106

Reference25 articles.

1. I.J. AALBERSBERG and G. ROZENBERG, “Theory of traces”, Theoretical Computer Science 60, p. 1–82, 1988.

2. J. BERSTEL, “Transductions and context free languages”, Teubner Studienbucher Informatik, 1979.

3. P. BONIZZONI, G. MAURI and G. PIGHIZZINI, “About infinite traces”, Proceedings of the ASMICS Workshop on Partially Commutative Monoids, Tech. Rep. TUM-I9002, Technische Universität München, 1989.

4. R. CORI, Y. METIVIER and W. ZIELONKA, “Asynchronous mappings and asynchronous cellular automata”, Tech. Rep. 89-97, LaBRI, Université de Bordeaux, France, 1989.

5. V. DIEKERT, “Combinatorics on traces”, Lecture Notes in Computer Science 454, 1990.

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

1. Classifying Recognizable Infinitary Trace Languages Using Word Automata;Mathematical Foundations of Computer Science 2014;2014

2. Toward a Structure Theory of Regular Infinitary Trace Languages;Automata, Languages, and Programming;2014

3. Muller message-passing automata and logics;Information and Computation;2008-09

4. Emptiness Is Decidable for Asynchronous Cellular Machines;CONCUR 2000 — Concurrency Theory;2000

5. Product Interval Automata: A Subclass of Timed Automata;Lecture Notes in Computer Science;1999