Finite automata and randomness

DOI10.1007/978-3-319-94631-3_1zbMATH Open1435.68184OpenAlexW2836329438MaRDI QIDQ777981FDOQ777981

Authors: Ludwig Staiger 

Publication date: 30 June 2020

Full work available at URL: https://hal.inria.fr/hal-01905642/file/470153_1_En_1_Chapter.pdf

Recommendations

• Finite State Incompressible Infinite Sequences
• Finite state incompressible infinite sequences
• scientific article
• An unpredictability approach to finite-state randomness
• scientific article; zbMATH DE number 1487695

zbMATH Keywords

finite automatafinite-state dimensioninfinite wordssubword complexitybetting automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Algorithmic randomness and dimension (03D32)

Cited In (3)

• Power of Randomization in Automata on Infinite Strings
• Enumeration and random generation of accessible automata
• Finitely nonstationary nondeterministic automata with random input

This page was built for publication: Finite automata and randomness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q777981)