Automata theory on infinite words: any video lectures?
up vote
8
down vote
favorite
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)
reference-request automata online-resources
add a comment |
up vote
8
down vote
favorite
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)
reference-request automata online-resources
You might want to search the internet using the terms "automatic sequences" and "combinatorics on words"
– Joel Reyes Noche
Nov 15 '12 at 10:14
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.
– Steven Stadnicki
Jan 22 '13 at 8:13
add a comment |
up vote
8
down vote
favorite
up vote
8
down vote
favorite
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)
reference-request automata online-resources
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)
reference-request automata online-resources
reference-request automata online-resources
edited Nov 27 at 17:31
asked Mar 16 '12 at 12:10
Ayrat
20518
20518
You might want to search the internet using the terms "automatic sequences" and "combinatorics on words"
– Joel Reyes Noche
Nov 15 '12 at 10:14
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.
– Steven Stadnicki
Jan 22 '13 at 8:13
add a comment |
You might want to search the internet using the terms "automatic sequences" and "combinatorics on words"
– Joel Reyes Noche
Nov 15 '12 at 10:14
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.
– Steven Stadnicki
Jan 22 '13 at 8:13
You might want to search the internet using the terms "automatic sequences" and "combinatorics on words"
– Joel Reyes Noche
Nov 15 '12 at 10:14
You might want to search the internet using the terms "automatic sequences" and "combinatorics on words"
– Joel Reyes Noche
Nov 15 '12 at 10:14
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.
– Steven Stadnicki
Jan 22 '13 at 8:13
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.
– Steven Stadnicki
Jan 22 '13 at 8:13
add a comment |
2 Answers
2
active
oldest
votes
up vote
1
down vote
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.
1
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)!
– Ayrat
Mar 16 '12 at 13:27
add a comment |
up vote
1
down vote
Try this out on youtube
https://www.youtube.com/watch?reload=9&v=KOu6IUssxbs
Please inform me whether that was helpful or not
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!
– Ayrat
Nov 25 at 17:43
I try to find something better......
– Mostafa Ayaz
Nov 27 at 8:01
add a comment |
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
1
down vote
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.
1
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)!
– Ayrat
Mar 16 '12 at 13:27
add a comment |
up vote
1
down vote
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.
1
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)!
– Ayrat
Mar 16 '12 at 13:27
add a comment |
up vote
1
down vote
up vote
1
down vote
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.
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.
answered Mar 16 '12 at 12:36
FiniteA
618413
618413
1
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)!
– Ayrat
Mar 16 '12 at 13:27
add a comment |
1
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)!
– Ayrat
Mar 16 '12 at 13:27
1
1
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)!
– Ayrat
Mar 16 '12 at 13:27
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)!
– Ayrat
Mar 16 '12 at 13:27
add a comment |
up vote
1
down vote
Try this out on youtube
https://www.youtube.com/watch?reload=9&v=KOu6IUssxbs
Please inform me whether that was helpful or not
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!
– Ayrat
Nov 25 at 17:43
I try to find something better......
– Mostafa Ayaz
Nov 27 at 8:01
add a comment |
up vote
1
down vote
Try this out on youtube
https://www.youtube.com/watch?reload=9&v=KOu6IUssxbs
Please inform me whether that was helpful or not
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!
– Ayrat
Nov 25 at 17:43
I try to find something better......
– Mostafa Ayaz
Nov 27 at 8:01
add a comment |
up vote
1
down vote
up vote
1
down vote
Try this out on youtube
https://www.youtube.com/watch?reload=9&v=KOu6IUssxbs
Please inform me whether that was helpful or not
Try this out on youtube
https://www.youtube.com/watch?reload=9&v=KOu6IUssxbs
Please inform me whether that was helpful or not
answered Nov 24 at 9:32
Mostafa Ayaz
12.9k3734
12.9k3734
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!
– Ayrat
Nov 25 at 17:43
I try to find something better......
– Mostafa Ayaz
Nov 27 at 8:01
add a comment |
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!
– Ayrat
Nov 25 at 17:43
I try to find something better......
– Mostafa Ayaz
Nov 27 at 8:01
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!
– Ayrat
Nov 25 at 17:43
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!
– Ayrat
Nov 25 at 17:43
I try to find something better......
– Mostafa Ayaz
Nov 27 at 8:01
I try to find something better......
– Mostafa Ayaz
Nov 27 at 8:01
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f120897%2fautomata-theory-on-infinite-words-any-video-lectures%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
You might want to search the internet using the terms "automatic sequences" and "combinatorics on words"
– Joel Reyes Noche
Nov 15 '12 at 10:14
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.
– Steven Stadnicki
Jan 22 '13 at 8:13