|
Click on a project in the table below for all publications registered to that project.
Project AFM5: Infinity: Infinite Objects: Computation, Modeling and Reasoning
2010
- Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Ariya Isihara and Jan Willem Klop
Productivity of Stream Definitions
Special issue devoted to selected papers from Fundamentals of Computation Theory 2007
Volume 411, Issues 4-5 of Theoretical Computer Science, pages 765-782
2009
- Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks and Jan Willem Klop
Unique Normal Forms in Infinitary Weakly Orthogonal Term Rewriting
Liber Amicorum for Roel de Vrijer
pages 47-60, 2009
- Jörg Endrullis, Dimitri Hendriks and Jan Willem Klop
Let's Make a Difference!
Liber Amicorum for Roel de Vrijer
pages 61-73, 2009
- Jörg Endrullis and Dimitri Hendriks
From Outermost to Context-Sensitive Rewriting
Rewriting Techniques and Applications, Proc. Int. Conf. - RTA 2009
volume 5595 of Lecture Notes in Computer Science, pages 305-319.
Springer, 2009.
- Jörg Endrullis, Clemens Grabmayer and Dimitri Hendriks
Complexity of Fractran and Productivity
Automated Deduction, Proc. Int. Conf. - CADE-22,
volume 5663 of Lecture Notes in Computer Science, pages 371-387.
Springer, 2009.
- Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, and Jan Willem Klop
Infinite Streams
Nieuwsbrief van de Nederlanse Vereniging voor Theoretische Informatica
pages 39-49, 2009.
- Jörg Endrullis, Clemens Grabmayer and Dimitri Hendriks
Complexity of Fractran and Productivity
Technical report, 18 pp. (v3, 2009-07-31).
2008
- Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Ariya Isihara and Jan Willem Klop Productivity of Stream Definitions Preprint 268, Logic Group Preprint Series Department of Philosophy, Utrecht University, 2008. Accepted for publication in a forthcoming special issue of TCS.
- Jörg Endrullis, Clemens Grabmayer and Dimitri Hendriks Data-Oblivious Stream Productivity In: I. Cervesato, H. Veith and A. Voronkov (eds.), Logic for Programming, Artificial Intelligence, and Reasoning - LPAR 2008, volume 5330 of Lecture Notes in Computer Science, pages 79-96. Springer, 2008.
- Jörg Endrullis, Clemens Grabmayer and Dimitri Hendriks Data-Oblivious Stream Productivity Technical report, 78 pp. (v5, 2008-07-19).
- Marc Bezem and Dimitri Hendriks On the Mechanization of the Proof of Hessenberg\u2019s Theorem in Coherent Logic In: Journal of Automated Reasoning, 40(1):61-85, 2008.
2007
- Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Ariya Isihara, and Jan Willem Klop. Productivity of Stream Definitions. In: 16th International Symposium on Fundamentals of Computation Theory (number 4639), LNCS, Springer, Budapest, Hungary, August 27-30, 2007,
- J.C.M. Baeten, F. Corradini, and C.A. Grabmayer. A Characterization of Regular Expressions Under Bisimulation. In: Journal of the ACM (volume 54, number 2), April 2007
- A. Silva and J. Rutten. Behavioural differential equations and coinduction for binary trees. In: Proceedings of WoLLIC 2007 (Edited by D. Leivant and R. de Queiroz) (volume 4576, pages 322-336), LNCS, Springer, 2007
- C.A. Kupke and Y. Venema. Coalgebraic automata theory: basic results. (CWI technical report SEN-E0701), 2007
We generalize some of the central results in automata theory to the abstraction level of coalgebras and thus lay out the foundations of the theory of coalgebra automata. In particular, we prove the following results for any functor F that preserves weak pullbacks. We show that the class of recognizable languages of F-coalgebras is closed under taking unions, intersections, and projections. We also prove that if an F-automaton accepts some coalgebra it accepts a finite one of bounded size. Our main technical result concerns an explicit construction which transforms a given alternating F-automaton into an equivalent nondeterministic one, of bounded size.
- H.H. Hansen, C. Kupke, and E. Pacuit. Bisimulation for Neighbourhood Structures. In: Proceedings of Calco 2007 (number 4624), LNCS, Springer, 2007
- C. Grabmayer. A Duality Between Proof Systems for Cyclic Term Graphs. In: Mathematical Structures in Computer Science (volume 17, number 3), 2007
2006
- C. Kupke and Y. Venema. Coalgebraic fixed point logics have the finite model property. In: Proceedings of the 8th International Workshop on Coalgebraic Methods in Computer Science, 2006, Vienna
- Jeroen Ketema and Jakob Grue Simonsen. Infinitary Combinatory Reduction Systems. (University of Copenhagen technical report D-558 DIKU), 2006
- Marc Bezem and Dimitri Hendriks. On the Mechanization of the Proof of Hessenberg's Theorem. In: Proceedings of the 6th International Workshop on Automated Deduction in Geometry (Edited by F. Botana and E. Roanes-Lozanoi) (pages 160-181), 2006, Universidad de Vigo
|
