A. R. Balasubramanian
ABSTRACT
We provide upper and lower bounds for the length of controlled bad sequences over the majoring and the minoring orderings of finite sets of Nd. The results are obtained by bounding the length of such sequences by functions from the Cichon hierarchy. This allows us to translate these results to bounds over the fast-growing complexity classes.
The obtained bounds are proven to be tight for the majoring ordering, which solves a problem left open by Abriola, Figueira and Senno (Theor. Comp. Sci, Vol. 603). Finally, we use the results on controlled bad sequences to prove upper bounds for the emptiness problem of some classes of automata.
- Parosh Aziz Abdulla, Karlis Cerans, Bengt Jonsson, and Yih-Kuen Tsay. 1996. General Decidability Theorems for Infinite-State Systems. In Proceedings, 11th Annual IEEE Symposium on Logic in Computer Science. 313--321. https://doi.org/10.1109/LICS.1996.561359Google Scholar
Cross Ref
- Parosh Aziz Abdulla and Bengt Jonsson. 2001. Ensuring completeness of symbolic verification methods for infinite-state systems. Theor. Comput. Sci. 256, 1-2 (2001), 145--167. https://doi.org/10.1016/S0304-3975(00)00105-5Google ScholarDigital Library
- Sergio Abriola and Santiago Figueira. 2014. A note on the order type of minoring orderings and some algebraic properties of ω2-well quasi-orderings. In XL Latin American Computing Conference, CLEI 2014. 1--9. https://doi.org/10.1109/CLEI.2014.6965188Google ScholarCross Ref
- Sergio Abriola, Santiago Figueira, and Gabriel Senno. 2015. Linearizing well quasi-orders and bounding the length of bad sequences. Theor. Comput. Sci. 603 (2015), 3--22. https://doi.org/10.1016/j.tcs.2015.07.012Google ScholarDigital Library
- Joseph B Kruskal. 1972. The Theory of Well-Quasi-Ordering: A Frequently Discovered Concept. Journal of Combinatorial Theory, Series A 13 (11 1972), 297--305. https://doi.org/10.1016/0097-3165(72)90063-5Google Scholar
- Pierre Chambart and Philippe Schnoebelen. 2008. The Ordinal Recursive Complexity of Lossy Channel Systems. In Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, LICS 2008, 24--27 June 2008, Pittsburgh, PA, USA. 205--216. https://doi.org/10.1109/LICS.2008.47Google ScholarDigital Library
- E.A. Cichon and E.Tahhan Bittar. 1998. Ordinal recursive bounds for Higman's theorem. Theoretical Computer Science 201, 1 (1998), 63--84. https://doi.org/10.1016/S0304-3975(97)00009-1Google ScholarDigital Library
- Nachum Dershowitz and Zohar Manna. 1979. Proving Termination with Multiset Orderings. Commun. ACM 22, 8 (1979), 465--476. https://doi.org/10.1145/359138.359142Google ScholarDigital Library
- Michael R. Fellows and Michael A. Langston. 1988. Nonconstructive tools for proving polynomial-time decidability. J. ACM 35, 3 (1988), 727--739. https://doi.org/10.1145/44483.44491Google ScholarDigital Library
- Diego Figueira. 2010. Reasoning on words and trees with data. Ph.D. Dissertation. École normale supérieure de Cachan, France. https://tel.archives-ouvertes.fr/tel-00718605Google Scholar
- Diego Figueira, Santiago Figueira, Sylvain Schmitz, and Philippe Schnoebelen. 2011. Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma. In Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science. 269--278. https://doi.org/10.1109/LICS.2011.39Google ScholarDigital Library
- Alain Finkel and Philippe Schnoebelen. 2001. Well-structured transition systems everywhere! Theor. Comput. Sci. 256, 1-2 (2001), 63--92. https://doi.org/10.1016/S0304-3975(00)00102-XGoogle ScholarDigital Library
- Graham Higman. 1952. Ordering by Divisibility in Abstract Algebras. Proceedings of the London Mathematical Society s3-2, 1 (1952), 326--336. https://doi.org/10.1112/plms/s3-2.1.326Google ScholarCross Ref
- Marcin Jurdzinski and Ranko Lazic. 2011. Alternating automata on data trees and XPath satisfiability. ACM Trans. Comput. Log. 12, 3 (2011), 19:1--19:21. https://doi.org/10.1145/1929954.1929956Google ScholarDigital Library
- M. H. Löb and S. S. Wainer. 1970. Hierarchies of number-theoretic functions. I. Archiv für mathematische Logik und Grundlagen forschung 13, 1 (Mar 1970), 39--51. https://doi.org/10.1007/BF01967649Google Scholar
- Bojan Mohar. 1996. Embedding Graphs in an Arbitrary Surface in Linear Time. In Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing. 392--397. https://doi.org/10.1145/237814.237986Google ScholarDigital Library
- Fernando Rosa-Velardo. 2017. Ordinal recursive complexity of Unordered Data Nets. Information and Computation 254 (2017), 41--58. https://doi.org/10.1016/j.ic.2017.02.002Google ScholarCross Ref
- Sylvain Schmitz. 2014. Complexity Bounds for Ordinal-Based Termination - (Invited Talk). In Reachability Problems - 8th International Workshop, RP 2014. 1--19. https://doi.org/10.1007/978-3-319-11439-2_1Google Scholar
- Sylvain Schmitz. 2016. Complexity Hierarchies beyond Elementary. TOCT 8, 1 (2016), 3:1--3:36. https://doi.org/10.1145/2858784Google Scholar
- Sylvain Schmitz and Philippe Schnoebelen. 2011. Multiply-Recursive Upper Bounds with Higman's Lemma. In Automata, Languages and Programming - 38th International Colloquium, ICALP 2011. 441--452. https://doi.org/10.1007/978-3-642-22012-8_35Google Scholar
Index Terms
- Complexity of controlled bad sequences over finite sets of Nd
Recommendations
Linearizing well quasi-orders and bounding the length of bad sequences
We study the length functions of controlled bad sequences over some well quasi-orders (wqo's) and classify them in the Fast Growing Hierarchy. We develop a new and self-contained study of the length of bad sequences over the disjoint product in N n (...
Allowable Interval Sequences and Separating Convex Sets in the Plane
In 2005, Goodman and Pollack introduced the concept of an allowable interval sequence, a combinatorial object which encodes properties of a family of pairwise disjoint convex sets in the plane. They, Dhandapani, and Holmsen used this concept to address ...
Comments