Author:
Althoff Christoph Schulte,Thomas Wolfgang,Wallmeier Nico
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. McNaughton, R.: Testing and generating infinite sequences by a finite automaton. Information and Control 9, 521–530 (1966)
2. Formal models and semantics;W. Thomas,1990
3. Pure and Applied Mathematics;D. Perrin,2004
4. Michel, M.: Complementation is more difficult with automata on infinite words. CNET, Paris (1988)
5. Lecture Notes in Computer Science;C. Löding,1999
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献