Skip to main navigation
Skip to search
Skip to main content
University of Copenhagen Research Portal Home
Help & FAQ
Dansk
English
Home
Profiles
Research output
Research units
Press/Media
Activities
Prizes
???studenttheses???
Datasets
Search by expertise, name or affiliation
On the Computational Complexity of the Languages of General Symbolic Dynamical Systems and Beta-Shifts
Jakob Grue Simonsen
Department of Computer Science
2
Citations (Scopus)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'On the Computational Complexity of the Languages of General Symbolic Dynamical Systems and Beta-Shifts'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Symbolic Dynamical System
100%
β-shifts
100%
System Shift
100%
Real numbers
62%
Constructible
50%
Non-decreasing Functions
50%
NP-hard
25%
Hardest Languages
12%
NP-hardness
12%
Polynomial Hierarchy
12%
EXPTIME-complete
12%
Complexity Hierarchy
12%
P-Complete
12%
NP-complete
12%
Alphabet Size
12%
Proof of Existence
12%
PSPACE-complete
12%
Complexity Classes
12%
Mathematics
Dynamical System
100%
Real Number
62%
Nondecreasing Function
50%
Complete Set
12%
Nonuniform
12%
Complexity Study
12%
proper time τ
12%
Computer Science
Dynamical System
100%
Real Number
62%
Complexity Class
12%
Polynomial Hierarchy
12%