Randomness of formal languages via automatic martingales
From MaRDI portal
Abstract: We define a notion of randomness for individual and collections of formal languages based on automatic martingales acting on sequences of words from some underlying domain. An automatic martingale bets if the incoming word belongs to the target language or not. Then randomness of both single languages and collections of languages is defined as a failure of automatic martingale to gain an unbounded capital by betting on the target language according to an incoming sequence of words, or a text. The randomness of formal languages turned out to be heavily dependent on the text. For very general classes of texts, any nonregular language happens to be random when considered individually. As for collections of languages, very general classes of texts permits nonrandomness of automatic families of languages only. On the other hand, an arbitrary computable language is be shown to be nonrandom under certain dynamic texts.
Recommendations
- scientific article; zbMATH DE number 1759420
- Nonuniform complexity and the randomness of certain complete languages
- Chaitin complexity, Shannon information content of a single event, and infinite random sequences. II
- On Languages Reducible to Algorithmically Random Languages
- A New Approach to Formal Language Theory by Kolmogorov Complexity
Cites work
- scientific article; zbMATH DE number 3808970 (Why is no real title available?)
- Algorithmic randomness and complexity.
- Automata theory and its applications
- Describing Groups
- Immunity and pseudorandomness of context-free languages
- Language identification in the limit
- Learnability of automatic classes
- Learning automatic families of languages
This page was built for publication: Randomness of formal languages via automatic martingales
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2420647)
