A Contraction Method to Decide MSO Theories of Deterministic Trees

A Contraction Method to Decide MSO Theories of Deterministic Trees

Bibliographic Details
Main Authors:	Montanari, A, Puppis, G
Format:	Journal article
Published:	2007

Similar Items

Decidability of MSO Theories of Tree Structures
by: Montanari, A, et al.
Published: (2004)

A Hierarchy of Automatic Words having a Decidable MSO Theory
by: Barany, V
Published: (2006)

A hierarchy of automatic omega−words having a decidable MSO theory
by: Barany, V
Published: (2008)

Decidability of the Theory of the Totally Unbounded omega−Layered Structure
by: Montanari, A, et al.
Published: (2004)

Optimizing tree decompositions in MSO
by: Mikołaj Bojańczyk, et al.
Published: (2022-02-01)

A Decidable Spatial Logic with Cone−shaped Cardinal Directions
by: Montanari, A, et al.
Published: (2009)

Maximal Decidable Fragments of Halpern and Shoham's Modal Logic of Intervals
by: Montanari, A, et al.
Published: (2010)

Decidability of the Interval Temporal Logic ABB Over the Natural Numbers
by: Montanari, A, et al.
Published: (2010)

Determinacy and rewriting of functional top–down and MSO tree transformations
by: Benedikt, M, et al.
Published: (2016)

Kernelizing MSO Properties of Trees of Fixed Height, and Some Consequences
by: Jakub Gajarsky, et al.
Published: (2015-04-01)

A decidable weakening of Compass Logic based on cone-shaped cardinal directions
by: Angelo Montanari, et al.
Published: (2015-12-01)

Expansions of MSO by cardinality relations
by: Alexis Bès
Published: (2013-12-01)

Extension Complexity, MSO Logic, and Treewidth
by: Petr Kolman, et al.
Published: (2020-10-01)

Undecidability of a weak version of MSO+U
by: Mikołaj Bojańczyk, et al.
Published: (2020-02-01)

DECIDE: A Deterministic Mixed Quantum-Classical Dynamics Approach
by: Zhe Liu, et al.
Published: (2022-07-01)

Recursion Schemes, the MSO Logic, and the U quantifier
by: Paweł Parys
Published: (2020-02-01)

Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity
by: Dušan Knop, et al.
Published: (2019-12-01)

A Dialectica-Like Interpretation of a Linear MSO on Infinite Words
by: Pradic, P, et al.
Published: (2019)

On the Relationships Between Theories of Time Granularity and the Monadic Second−order Theory of One Successor
by: Montanari, A, et al.
Published: (2006)

A Theory of Ultimately Periodic Languages and Automata With an Application to Time Granularity
by: Bresolin, D, et al.
Published: (2009)

A B\"uchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage
by: Joost Engelfriet, et al.
Published: (2020-08-01)

A Contraction Theory-Based Analysis of the Stability of the Deterministic Extended Kalman Filter
by: Bonnabel, Silvere, et al.
Published: (2015)

Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories
by: Luis Barguñó, et al.
Published: (2013-04-01)

ConTaCT: Deciding to Communicate during Time-Critical Collaborative Tasks in Unknown, Deterministic Domains
by: Unhelkar, Vaibhav Vasant, et al.
Published: (2016)

A decidable characterization of locally testable tree languages
by: Thomas Place, et al.
Published: (2011-11-01)

Deciding the weak definability of Büchi definable tree languages
by: Colcombet, T, et al.
Published: (2013)

Deciding definability in FO2(<h,<v) on trees
by: Thomas Place, et al.
Published: (2015-09-01)

The Wadge Hierarchy of Deterministic Tree Languages
by: Filip Murlak
Published: (2008-12-01)

Deterministic scheduling theory /
by: 329470 Parker, R. Gary
Published: (1995)

On the decidability of finite extensions of decidable fields
by: Thanagopal, K
Published: (2018)

Decider
by: Francis, Dick, 1920-2010 376665
Published: (1994)

DECIDING TOGETHER
by: Lewis A. Kornhauser
Published: (2016-01-01)

Enumerability, decidability, computability : an introduction to the theory of recursive functions /
by: 430372 Hermes, Hans
Published: (1969)

Infinite and Bi-infinite Words with Decidable Monadic Theories
by: Dietrich Kuske, et al.
Published: (2018-08-01)

System of marketing deciding support based on game theory
by: Gordana Dukić, et al.
Published: (2008-12-01)

Bounded reparability for regular tree languages
by: Puppis, G, et al.
Published: (2012)

Operational State Complexity of Deterministic Unranked Tree Automata
by: Xiaoxue Piao, et al.
Published: (2010-08-01)

Efficient Implementation for Deterministic Finite Tree Automata Minimization
by: Younes Guellouma, et al.
Published: (2016-12-01)

Thinking and deciding /
by: 221448 Baron, Jonathan
Published: (1988)

Deciding how to decide: Using the Digital Preservation Storage Criteria
by: Schaefer, Sibyl K, et al.
Published: (2021)