On the Decidability of MSO+U on Infinite Trees

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-662-43951-7_5
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

A Dialectica-Like Interpretation of a Linear MSO on Infinite Words

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

Decidability of Periodicity for Infinite Words

RAIRO - Theoretical Informatics and Applications
MathematicsComputer Science ApplicationsSoftware
1986English

The Topological Complexity of MSO+U and Related Automata Models

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2012English

On the Decidability of FDNC Programs

Intelligenza Artificiale
Artificial Intelligence
2011English

Kernelizing MSO Properties of Trees of Fixed Height, and Some Consequences

Logical Methods in Computer Science
Computer ScienceTheoretical Computer Science
2015English

Infinite Characters on GL(Q), on SL (Z), and on Groups Actingt on Trees

Journal of Functional Analysis
Analysis
2019English

Excluding Infinite Trees

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1993English

On the Decidability of Functional Uncertainty

1993English

On the Decidability of Query Containment Under Constraints

1998English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy