Strategical languages of infinite words

DOI10.1016/J.IPL.2009.03.019zbMATH Open1197.68050arXiv1003.0662OpenAlexW2125383005MaRDI QIDQ989477FDOQ989477

C. Selmi, B. Ould M. Lemine, Mustapha Arfi

Publication date: 20 August 2010

Published in: Information Processing Letters (Search for Journal in Brave)

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.

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

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

zbMATH Keywords

topologygame theorywordsNash equilibriumformal languagesstrategyinfinite words

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Noncooperative games (91A10)

Cites Work

• Title not available (Why is that?)
• Non-cooperative games
• Title not available (Why is that?)
• Title not available (Why is that?)
• Adherences of languages

Cited In (1)

• Languages obtained from infinite words

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)