Prediction of infinite words with automata

DOI10.1007/s00224-016-9739-4zbMath1393.68097arXiv1603.02597OpenAlexW2565211383MaRDI QIDQ1635815

Y. Aharonov

Publication date: 1 June 2018

Published in: Theory of Computing Systems, Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1603.02597

zbMATH Keywords

infinite wordautomatonsequence prediction

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45)

Related Items (1)

Prediction of infinite words with automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity of multi-head finite automata: origins and directions
• Inductive inference of ultimately periodic sequences
• An unpredictability approach to finite-state randomness
• Prediction of infinite words with automata
• One way multihead deterministic finite automata
• Minimax vs. Bayes Prediction
• Learning Regular Omega Languages
• On Infinite Words Determined by Stack Automata.
• Is There an Elegant Universal Theory of Prediction?
• The Complexity of Finding Cycles in Periodic Functions
• Universal prediction of individual sequences
• Toward a mathematical theory of inductive inference
• Learning Automata - A Survey
• One-way stack automata
• A formal theory of inductive inference. Part I
• Language identification in the limit
• High-confidence predictions under adversarial uncertainty

This page was built for publication: Prediction of infinite words with automata