9
$\begingroup$

I am fun of automata theory (on infinite words). Can you suggest good video lectures on the subject?

An ideal course would cover topics like Buchi automata, LTL->Buchi translation, Streett and parity automata, determinization (or idea...), complementation, minimization, alternating automata. Also touching the topic of tree automata.

I am sure these topics are taught in universities that have strong formal-methods groups (e.g. in Munich, Saarland, Paris, Warsaw, etc.), but, unfortunately, those lectures are neither recorded nor shared (to my knowledge).

(there is a good one here, but it is accessible from RWTH University only)

$\endgroup$
2
  • $\begingroup$ You might want to search the internet using the terms "automatic sequences" and "combinatorics on words" $\endgroup$
    – JRN
    Commented Nov 15, 2012 at 10:14
  • $\begingroup$ While it's not a video lecture, Wikipedia's page on infinitary automata (en.wikipedia.org/wiki/%CE%A9-automaton ) should provide an excellent starting point with a number of terms to get you searching further and even a pointer to a slide show. $\endgroup$ Commented Jan 22, 2013 at 8:13

2 Answers 2

1
$\begingroup$

I found this lecture on Theory of Computation on youtube: http://www.youtube.com/watch?v=HyUK5RAJg1c

I also suggest you get the book of Michael Sipser -- Introduction to the Theory of Computation.

$\endgroup$
1
  • 1
    $\begingroup$ if you have something about automata on infinite words, please share. and thanks for the link(i do have the book, yea, it is very good)! $\endgroup$
    – Ayrat
    Commented Mar 16, 2012 at 13:27
1
$\begingroup$

Try this out on youtube

https://www.youtube.com/watch?reload=9&v=KOu6IUssxbs

Please inform me whether that was helpful or not

$\endgroup$
2
  • $\begingroup$ The video you suggested is an interesting beginner-level source, which is given in the broader context of model checking (it explains what are buchi automata and some simple properties). It is not bad, but what I am looking for is a more in-depth course that covers topics like: buchi automata, LTL->Buchi translation, determinization (or idea...), complementation, minimization, alternating automata, etc. Thanks anyway! $\endgroup$
    – Ayrat
    Commented Nov 25, 2018 at 17:43
  • $\begingroup$ I try to find something better...... $\endgroup$ Commented Nov 27, 2018 at 8:01

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .