Abstract
We show that many natural structures related to the so called homomorphic preorder (or h-preorder) on the iterated labeled forests have isomorphic copies computable in polynomial time. Moreover, the polynomials in the upper bounds are of low degree which makes the computational content of the whole theory feasible. We apply these results to relevant questions of automata and computability theory.
The work is supported by Mathematical Center in Akademgorodok under agreement No. 075-15-2019-1613 with the Ministry of Science and Higher Education of the Russian Federation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Aho, A., Hopcroft, J.V., Ullman, J.E.: The Design and Analysis of Computer Algorithms. Addison Wesley, Massachusetts (1969)
Alaev, P.E.: Structures computable in polynomial time. I. Algebra Logic 55(6), 421–435 (2016)
Alaev, P.E.: Polynomially computable structures with finitely many generators. Algebra Logic 59(3), 266–272 (2020)
Cenzer, D., Remmel, J.: Polynomial time versus recursive models. Ann. Pure Appl. Logic 54(1), 17–58 (1991)
Hertling P.: Topologische Komplexitätsgrade von Funktionen mit endlichem Bild. Informatik-Berichte, vol. 152, 34 pages. Fernuniversität Hagen, December 1993
Hertling P., Selivanov V.L.: Complexity issues for preorders on finite labeled forests. In: Brattka, V., Diener, H., Spreen, D. (eds.) Logic, Computation, Hierarchies, pp. 165–190. Ontos Publishing, de Gruiter, Boston-Berlin (2014)
Selivanov, V.: Classifying \(\omega \)-regular aperiodic k-partitions. In: Jirásková, G., Pighizzini, G. (eds.) DCFS 2020. LNCS, vol. 12442, pp. 193–205. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-62536-8_16
Selivanov V.: Wadge degrees of classes of \(\omega \)-regular \(k\)-partitions. Submitted, Arxiv:2104.10358
Selivanov, V.: Non-collapse of the effective Wadge hierarchy. In: De Mol, L., Weiermann, A., Manea, F., Fernández-Duque, D. (eds.) CiE 2021. LNCS, vol. 12813, pp. 407–416. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-80049-9_40
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 IFIP International Federation for Information Processing
About this paper
Cite this paper
Alaev, P., Selivanov, V. (2021). Complexity Issues for the Iterated h-Preorders. In: Han, YS., Ko, SK. (eds) Descriptional Complexity of Formal Systems. DCFS 2021. Lecture Notes in Computer Science(), vol 13037. Springer, Cham. https://doi.org/10.1007/978-3-030-93489-7_1
Download citation
DOI: https://doi.org/10.1007/978-3-030-93489-7_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-93488-0
Online ISBN: 978-3-030-93489-7
eBook Packages: Computer ScienceComputer Science (R0)
