Finite Automata and Randomness - Archive ouverte HAL Access content directly
Conference Papers Year : 2018

Finite Automata and Randomness

(1)
1
Ludwig Staiger
  • Function : Author
  • PersonId : 1038045

Abstract

The lecture surveys approaches using finite automata to define several notions of (automata-theoretic) randomness.It focuses on the one hand on automata-theoretic randomness of infinite sequences in connection with automata-independent notions like disjunctivity and Borel normality.On the other hand it considers the scale of relaxations of randomness (Borel normality and disjunctivity), that is, finite-state dimension and subword complexity and their interrelations.
Fichier principal
Vignette du fichier
470153_1_En_1_Chapter.pdf (404.81 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01905642 , version 1 (26-10-2018)

Licence

Attribution - CC BY 4.0

Identifiers

Cite

Ludwig Staiger. Finite Automata and Randomness. 20th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2018, Halifax, NS, Canada. pp.1-10, ⟨10.1007/978-3-319-94631-3_1⟩. ⟨hal-01905642⟩
55 View
59 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More