Items where Subject is "Computer sciences > Computer science > Computational science foundations"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Jump to: A | C | D | F | M | T
Number of items at this level: 15.

A

Alberucci, Luca and Facchini, Alessandro (2009) On Modal μ-Calculus and Gödel-Löb Logic. Studia Logica, 91 (2). pp. 145-169. ISSN 0039-3215

Alberucci, Luca and Facchini, Alessandro (2009) The modal μ-calculus hierarchy over restricted classes of transition systems. Journal of Symbolic Logic, 74 (4). pp. 1367-1400. ISSN 0022-4812

C

Cabessa, Jérémie and Duparc, Jacques and Facchini, Alessandro and Murlak, Filip (2009) The Wadge Hierarchy of Max-Regular Languages. In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2009, December 15-17, 2009, IIT Kanpur, India.

Carreiro, Facundo and Facchini, Alessandro and Venema, Yde and Zanasi, Fabio (2014) Weak MSO: automata and expressiveness modulo bisimilarity. In: Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, Vienna, Austria, July 14 - 18, 2014.

D

Duparc, Jacques and Facchini, Alessandro (2008) Describing the Wadge Hierarchy for the Alternation Free Fragment of μ-Calculus (I). In: Logic and Theory of Algorithms, 4th Conference on Computability in Europe, CiE 2008, Athens, Greece, June 15-20, 2008, Proceedings.

Duparc, Jacques and Facchini, Alessandro (2009) A Playful Glance at Hierarchical Questions for Two-Way Alternating Automata. In: ILC 2007. Revised Selected Papers Infinity in Logic and Computation, International Conference, ILC 2007, November 3-5, 2007, Cape Town, South Africa.

Duparc, Jacques and Facchini, Alessandro and Murlak, Filip (2011) Definable Operations On Weakly Recognizable Sets of Trees. In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India.

Duparc, Jacques and Facchini, Alessandro and Murlak, Filip (2009) Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata. In: Computer Science Logic, 23rd international Workshop, CSL 2009, 18th Annual Conference of the EACSL, Coimbra, Portugal, September 7-11, 2009. Proceedings.

F

Facchini, Alessandro and Hirai, Yoichi and Marx, Maarten and Sherkhonov, Evgeny (2015) Containment for Conditional Tree Patterns. Logical Methods in Computer Science, 11 (2).

Facchini, Alessandro and Michalewski, Henryk (2014) Deciding the Borel Complexity of Regular Tree Languages. In: Language, Life, Limits - 10th Conference on Computability in Europe, CiE 2014, Budapest, Hungary, June 23-27, 2014. Proceedings.

Facchini, Alessandro and Murlak, Filip and Skrzypczak, Michal (2016) Index Problems for Game Automata. ACM Transactions on Computational Logic, 17 (4).

Facchini, Alessandro and Murlak, Filip and Skrzypczak, Michal (2013) Rabin-Mostowski Index Problem: A Step beyond Deterministic Automata. In: 28th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2013, New Orleans, LA, USA, June 25-28, 2013.

Facchini, Alessandro and Venema, Yde and Zanasi, Fabio (2013) A Characterization Theorem for the Alternation-Free Fragment of the Modal μ-Calculus. In: 28th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2013, New Orleans, LA, USA, June 25-28, 2013.

M

Molinari, Monia Elisa and Cannata, Massimiliano and Begueria, Santiago and Ambrosi, Christian (2012) Gis-based Calibration of MassMov2D. Transactions in GIS, 16 (2). pp. 215-231. ISSN 1361-1682

T

Ten Cate, Balder and Facchini, Alessandro (2011) Characterizing EF over Infinite Trees and Modal Logic on Transitive Graphs. In: Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings.

This list was generated on Thu Nov 23 21:27:46 2017 CET.