Strategical languages of infinite words

Strategical languages of infinite words

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 s...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Information processing letters 2009-06, Vol.109 (13), p.749-753
Hauptverfasser: Arfi, M., Lemine, B. Ould M., Selmi, C.
Format: Artikel
Sprache:eng
Schlagworte:
Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer Science
Computer Science and Game Theory
Computer science
control theory
systems
Exact sciences and technology
Formal languages
Game theory
Infinite words
Information processing
Language
Language theory and syntactical analysis
Miscellaneous
Nash equilibrium
Strategy
Studies
Theoretical computing
Topology
Words
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0020-0190
1872-6119
DOI:10.1016/j.ipl.2009.03.019