Background Survey (Automata Logic and Games)

JavaScript isn't enabled in your browser, so this file can't be opened. Enable and reload.

Please answer the following questions. This is not an exam, I just want to get a feel of how comfortable you are with the background, and how much of the material you already know.
If you fill things that you don't really know, the course will just run too fast.
If you don't fill things you know well, the course will be boring (not easier or harder, just boring).

In order to determinize an NFA (nondeterministic finite automaton) to a DFA (deterministic finite automaton) we use:

NFAs cannot be determinized.

Never heard of this.

I vaguely remember this is possible, not sure how, but something about an exponential blowup.

The "subset construction" (the states of the DFA are the powerset of those of the NFA)

Clear selection

How well are you familiar with the class PSPACE

Never heard of it

I know the definition, not much more.

I know Savitch's theorem (PSPACE=NPSPACE), and I've seen PSPACE-complete problems.

Clear selection

Prior to Lecture 1, did you know what a Büchi automaton is?

Never heard of it.

I knew it's an automaton over infinite words.

I remembered exactly what it is.

Clear selection

Have you heard of Rabin, Streett and parity automata?

None of them.

Some, but I don't really remember much about them.

I remember their definitions and the relationship between them.

Clear selection

Have you heard of LTL and model checking

Neither

I remember what LTL is, and vaguely recall that we can solve the model-checking problem

I know LTL and the procedure to perform model-checking.

I've seen Vardi-Wolper, but it's much neater through alternating automata

Clear selection

Have you heard of Monadic Second Order Logic (MSO) and Büchi's theorem?

No.

Yes.

Clear selection

Have you heard of reachability, Büchi, and parity games?

I Vaguely remember some of them

I've seen parity games and some results about them.

I read the recent developments in parity games, and the quasi-polynomial algorithm.

Clear selection

In answering the above questions, I felt I was:

A bit underestimating myself

Exactly reflecting my knowledge

Slightly overestimating myself

Randomly picking answers.

Clear selection

Submit

Clear form

This content is neither created nor endorsed by Google. Report Abuse - Terms of Service - Privacy Policy

Forms