Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Lecture Notes in Computer Science;P.A. Abdulla,2008
2. Blumensath, A., Otto, M., Weyer, M.: Boundedness of monadic second-order formulae over finite words. In: ICALP 2009 (2009)
3. Bojańczyk, M., Colcombet, T.: Bounds in omega-regularity. In: LICS 2006, pp. 285–296 (2006)
4. Lecture Notes in Computer Science;T. Colcombet,2008
5. Lecture Notes in Computer Science;T. Colcombet,2008
Cited by
63 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Token Games and History-Deterministic Quantitative-Automata;Logical Methods in Computer Science;2023-11-03
2. The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete);2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26
3. Cost Automata, Safe Schemes, and Downward Closures;Fundamenta Informaticae;2023-04-07
4. Good-for-games $\omega$-Pushdown Automata;Logical Methods in Computer Science;2023-02-15
5. Using the past for resolving the future;Frontiers in Computer Science;2023-01-13