Sign in
Sign up
Pause
Mute
Subtitles not available
Off
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen
Polynomial distinguishability of timed automata
Published on Oct 09, 2008
3452 Views
Sicco Verwer
Colloquium on Grammatical Inference 2008 - Saint-Malo
Bookmark
You need to login
Share
Related categories
Computer Science
