Closure properties of coalgebra automata

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2005, Pages 199-208

  Kupke, Clemens ^a   Venema, Yde ^a  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; AUTOMATION; FORMAL LANGUAGES; MATHEMATICAL TRANSFORMATIONS;

COALGEBRA AUTOMATA; COALGEBRAS; PULLBACK PRESERVING FACTOR;

AUTOMATA THEORY;

EID: 26844467322     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. J. Adámek and V. Trnková. Automata and Algebras in Categories. Kluwer Academic Publishers, 1990.
2. A. Arnold and D. Niwiński. Rudiments of μ-calculus, volume 146 of Studies in Logic. North-Holland, 2001.
3. A. Baltag. A logic for coalgebraic simulation. In H. Reichel, editor, Coalgebraic Methods in Computer Science (CMCS'00), volume 33 of Electronic Notes in Theoretical Computer Science, pages 41-60, 2000.
4. E. Clarke, O. Grumberg, and D. Peled, editors. Model Checking. The MIT Press, 2000.
5. G. d'Agostino and M. Hollenberg. Logical questions concerning the μ-calculus. Journal of Symbolic Logic, 65:310-332, 2000.
6. E. Grädel, W. Thomas, and T. Wilke, editors. Automata, Logic, and Infinite Games, volume 2500 of LNCS. Springer, 2002.
7. D. Janin and I. Walukiewicz. Automata for the modal μ-calculus and related results. In Proc. MFCS'95, pages 552-562. Springer, 1995. LNCS 969.
8. L. Moss. Coalgebraic logic. Annals of Pure and Applied Logic, 96:277-317, 1999. (Erratum published APAL 99:241-259, 1999.
9. D. Muller and P. Schupp. Simulating alternating tree automata by nondeterministic ones. Theoretical Computer Science, 141:69-107, 1995.
10. M.O. Rabin. Decidability of second-order theories and automata on infinite trees. Transactions of the American Mathematical Society, 141:1-35, 1969.
11. J. Rutten. Universal coalgebra: A theory of systems. Theoretical Computer Science, 249:3-80, 2000.
12. V. Trnková. Relational automata in a category and theory of languages. In Proc. FCT 1977, pages 340-355. Springer, 1977. LNCS 56.
13. Y. Venema. Automata and fixed point logics for coalgebras. Electronic Notes in Theoretical Computer Science, 106:355-375, 2004.