Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
FSTTCS
2009
Springer
2009
Springer
Synthesis of Finite-state and Definable Winning Strategies
ABSTRACT. Church's Problem asks for the construction of a procedure which, given a logical specification on sequence pairs, realizes for any input sequence I an output sequence O such that (I, O) satisfies . McNaughton reduced Church's Problem to a problem about two-player -games. B
Real-time TrafficChurch's Problem | Finite-state Strategies | FSTTCS 2009 | Mcnaughton Reduced Church | Software Engineering |
| Added | 16 Aug 2010 |
| Updated | 16 Aug 2010 |
| Type | Conference |
| Year | 2009 |
| Where | FSTTCS |
| Authors | Alexander Rabinovich |
Comments (0)
Researcher Info
|
