%0 Conference Proceedings
%T Finite Automata and Randomness
%+ Martin-Luther-Universität Halle Wittenberg (MLU)
%A Staiger, Ludwig
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 20th International Conference on Descriptional Complexity of Formal Systems (DCFS)
%C Halifax, NS, Canada
%Y Stavros Konstantinidis
%Y Giovanni Pighizzini
%I Springer International Publishing
%3 Descriptional Complexity of Formal Systems
%V LNCS-10952
%P 1-10
%8 2018-07-25
%D 2018
%R 10.1007/978-3-319-94631-3_1
%K Betting automata
%K Finite-state dimension
%K Subword complexity
%K Finite automata
%K Infinite words
%Z Computer Science [cs]Conference papers
%X 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.
%G English
%Z TC 1
%Z WG 1.2
%2 https://inria.hal.science/hal-01905642/document
%2 https://inria.hal.science/hal-01905642/file/470153_1_En_1_Chapter.pdf
%L hal-01905642
%U https://inria.hal.science/hal-01905642
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC1
%~ IFIP-WG
%~ IFIP-DCFS
%~ IFIP-WG1-2
%~ IFIP-LNCS-10952