Abstract: We deal in this paper with strategical languages of infinite words, that is those generated by a nondeterministic strategy in the sense of game theory. We first show the existence of a minimal strategy for such languages, for which we give an explicit expression. Then we characterize the family of strategical languages as that of closed ones, in the topological space of infinite words. Finally, we give a definition of a Nash equilibrium for such languages, that we illustrate with a famous example.
Recommendations
- scientific article; zbMATH DE number 4039871
- Boundedness in languages of infinite words
- scientific article; zbMATH DE number 3556015
- On the size of an infinite language
- On infinite words determined by indexed languages
- Infinite-word languages and continuous mappings
- scientific article; zbMATH DE number 1263593
- Languages of profinite words and the limitedness problem
- Infinite hierarchy of permutation languages
Cites work
Cited in
(4)
This page was built for publication: Strategical languages of infinite words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q989477)
