Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Lecture Notes in Computer Science;P.A. Abdulla,2008
2. Bojańczyk, M.: The common fragment of ACTL and LTL. In: Foundations of Software Science and Computation Structures, pp. 172–185 (2008)
3. Bojańczyk, M., Colcombet, T.: Omega-regular expressions with bounds. In: Logic in Computer Science, pp. 285–296 (2006)
4. Bojanczyk, M., Parys, P.: XPath evaluation in linear time. In: PODS, pp. 241–250 (2008)
5. Lecture Notes in Computer Science;T. Colcombet,2007
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On the Growth Rates of Polyregular Functions;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26
2. Going Higher in First-Order Quantifier Alternation Hierarchies on Words;Journal of the ACM;2019-04-26
3. Tight Worst-Case Bounds for Polynomial Loop Programs;Lecture Notes in Computer Science;2019
4. Regular and First-Order List Functions;Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science;2018-07-09
5. Going Higher in the First-Order Quantifier Alternation Hierarchy on Words;Automata, Languages, and Programming;2014