Decidability of Periodicity for Infinite Words

RAIRO - Theoretical Informatics and Applications - France
doi 10.1051/ita/1986200100431
Full Text
Abstract

Available in full text

Date
Authors
Publisher

EDP Sciences

Related search

On the Decidability of MSO+U on Infinite Trees

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Decidable Problems for Probabilistic Automata on Infinite Words

2012English

Drunken Man Infinite Words Complexity

RAIRO - Theoretical Informatics and Applications
MathematicsComputer Science ApplicationsSoftware
2008English

Degrees of Infinite Words, Polynomials and Atoms

International Journal of Foundations of Computer Science
Computer Science
2018English

Bounds on the Kolmogorov Complexity Function for Infinite Words

2016English

Length-K-Overlap-Free Binary Infinite Words

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2012English

Characterizations of Finite and Infinite Episturmian Words via Lexicographic Orderings

European Journal of Combinatorics
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTheoretical Computer ScienceTopology
2008English

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

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

Dynamic Logic for Data-Aware Systems: Decidability Results

2017English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy