Back to Results
First PageMeta Content
Formal languages / Computer science / Theory of computation / Ω-automaton / Omega language / Büchi automaton / Symbol / Determinacy / Regular language / Automata theory / Mathematics / Theoretical computer science


Languages vs. ω-Languages in Regular Infinite Games Namit Chaturvedi? , Jörg Olschewski?? , and Wolfgang Thomas Lehrstuhl Informatik 7, RWTH Aachen University, Germany {chaturvedi,olschewski,thomas}@automata.rwth-aache
Add to Reading List

Document Date: 2012-05-29 11:02:51

Open Document

File Size: 380,17 KB

Share Result on Facebook

City

perm / /

Company

K. Let us / /

/

Facility

RWTH Aachen University / /

Organization

RWTH Aachen University / /

Person

Wolfgang Thomas Lehrstuhl Informatik / /

Position

first Player / Player / Let Player / Player 1 strategy / winning player / otherwise Player / namely Player / /

SocialTag