Algorithmic Approach to Devaney Chaos in Shift Spaces

Authors:
Piotr Oprocha
Affiliations:
(Correspd.) Faculty of Applied Mathematics, AGH University of Science and Technology, al. Mickiewicza 30, 30-059 Kraków, Poland. oprocha@agh.edu.pl
Venue:
Fundamenta Informaticae
Year:
2008

Citing 6
Cited 0

Minimal automation for a factorial, transitive, and rational language

Theoretical Computer Science
Introduction to algorithms

Introduction to algorithms
On Devaney's definition of chaos

American Mathematical Monthly
Sofic shifts with synchronizing presentations

Theoretical Computer Science
An introduction to symbolic dynamics and coding

An introduction to symbolic dynamics and coding
Symbolic dynamics and finite automata

Handbook of formal languages, vol. 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

Among the class of sofic shifts Devaney chaos is equivalent to topological transitivity. The aim of this paper is to study possibilities of detection of this phenomena when a right-resolving graph presentation of a sofic shift is given. We show that Devaney chaos detection is co-NP-hard problem and point out some possible improvements of algorithms known from the literature.