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

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-030-17127-8_27
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer International Publishing

Related search

On the Decidability of MSO+U on Infinite Trees

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

On Infinite-Dimensional Linear Spaces

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1945English

Decidable Problems for Probabilistic Automata on Infinite Words

2012English

A Criterion for Linear Independence of Infinite Products

Analele Stiintifice ale Universitatii Ovidius Constanta, Seria Matematica
Applied MathematicsAnalysis
2015English

Drunken Man Infinite Words Complexity

RAIRO - Theoretical Informatics and Applications
MathematicsComputer Science ApplicationsSoftware
2008English

Decidability of Periodicity for Infinite Words

RAIRO - Theoretical Informatics and Applications
MathematicsComputer Science ApplicationsSoftware
1986English

Bounds on the Kolmogorov Complexity Function for Infinite Words

2016English

On an Infinite Integral Linear Group

Bulletin of the Australian Mathematical Society
Mathematics
1970English

Degrees of Infinite Words, Polynomials and Atoms

International Journal of Foundations of Computer Science
Computer Science
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy