Cited By
View all- Krogman RCenzer D(2021)Complexity and Categoricity of Injection Structures Induced by Finite State TransducersConnecting with Computability10.1007/978-3-030-80049-9_10(106-119)Online publication date: 5-Jul-2021
Effective Categoricity of Automatic Equivalence and Nested Equivalence Structures
Pages 1110 - 1139
Abstract
We study automatic equivalence and nested equivalence structures. The goal is to compare and contrast these automatic structures with computable equivalence and nested equivalence structures. Equivalence structures may be characterized by their characters which encodes the number of equivalence classes of any given size. The characters of computably categorical, categorical but not computably categorical, or categorical but not categorical have been determined. We show that every computably categorical equivalence structure has an automatic copy, but not every categorical structure has an automatic copy. We construct an automatic equivalence structure which is categorical but not computably categorical and another automatic equivalence structure which is not categorical. We observe that the theory of an automatic equivalence structure is decidable and hence the character of any automatic equivalence structure is computable. On the other hand, there is a computable character which is not the character of any automatic equivalence structure. We show that any two automatic equivalence structures which are isomorphic are in fact computably isomorphic. Moreover, we show that for certain characters, there is always a exponential time isomorphism between two automatic equivalence structures with that character. Finally, we briefly consider nested equivalence structures and construct an automatic nested equivalence structure that is not categorical but categorical and an automatic nested equivalence structure that is not categorical.
References
[1]
Alaev PAtomless boolean algebras computable in polynomial timeSib. Electron. Mat. Izv.2016131035-103935800471390.03033
[2]
Alaev P Existence and uniqueness of structures computable in polynomial time Algebra Log. 2016 55 72-76
[3]
Alaev P Structures computable in polynomial time one Algebra Log. 2016 55 421-435
[4]
Alaev P Structures computable in polynomial time two Algebra Log. 2017 56 429-442
[5]
Alaev PCategoricity for primitively recursive and polynomial boolean algebrasAlgebra Log.201857251-2743892658
[6]
Ash C, Knight J, Manasse M, and Slaman TGeneric copies of countable structuresAnn. Pure Appl. Log.198942195-205998606
[7]
Bar-Hillel Y, Perlse M, and Shamir EOn formal properties of simple phrase structure grammarsZ. Phonetik. Sprachwiss. Kommunikationsforsch.196114143-1721513760106.34501
[8]
Bazhenov N, Downey R, Kalimullin I, and Melnikov AFoundations of online structure theoryBull. Symbol. Log.201925141-1813984971
[9]
Bazhenov, N., Harrison-Trainor, M., Kalimullin, I., Melnikov, A., Ng, K.M.x: Automatic and polynomial-time algebraic structures. J. Symbolic Logic, To appear
[10]
Blumensath, A., Grädel, E.: Automatic structures. In: Proc. LICS ’00, pp. 51–62 (2000)
[11]
Büchi JRWeak second-order arithmetic and finite automataZ. Math. Logik Grundlagen Math.1960666-92125010
[12]
Buss, S., Douglas Cenzer, S., Minnes, M., Remmel, J.B.: Injection structures specified by finite state transducers. In: Computability and complexity, volume 10010 of Lecture Notes in Comput. Sci., pp. 394–417. Springer, Cham (2017)
[13]
Calvert W, Cenzer D, Harizanov V, and Morozov AEffective categoricity of equivalence structuresAnn. Pure Appl. Log.2005141200661-7822299301103.03037
[14]
Carson, J.: Computational complexity of automatic structures. Ph.D Dissertation, University of Notre Dame (2011)
[15]
Cenzer D and Remmel JBComplexity and categoricityInf. Comput.19981402-251492843
[16]
Delhommé CAutomaticité des ordinaux et des graphes homogènesC. R. Math. Acad. Sci. Paris200433915-102075224
[17]
Ganardi, M., Khoussainov, B.: Automatic equivalence structures of polynomial growth. In Maribel Ferná,ndez and Anca Muscholl, editors, CSL 2020, Proceedings of the Computer Science Logic Conference, volume 152 of LIPIcs, pp. 21:1–21:16 (2020)
[18]
Hodgson BROn direct products of automaton decidable theoriesTheoret. Comput. Sci.1982193331-335671875
[19]
Kach AM and Turetsky D${\delta _{2}^{0}}$δ20 categoricity of equivalence structuresNew Zealand J. Math.200939143-14927724051234.03021
[20]
Karp RM and Held MFinite-state processes and dynamic programmingSIAM J. Appl. Math.196715693-718220512
[21]
Khoussainov B, Liu J, and Minnes MUnary automatic graphs: an algorithmic perspectiveMath. Struct. Comput. Sci.2009191133-1522482024
[22]
Khoussainov, B., Minnes, M.: Three lectures on automatic structures. In: Delon, F., Kohlenbach, U., Maddy, P., Stephan, F. (eds.) Logic Colloquium Lecture Notes in Logic, p 2010. Cambridge University Press (2007)
[23]
Khoussainov, B., Nerode, A.: Automatic presentations of structures. volume 960 of Springer Lecture Notes in Computer Science, pp. 367–392 (1995)
[24]
Khoussainov B and Nerode AOpen qeustions in the theory of automatic structuresBullet. Eur. Assoc. Theor. Comput. Sci. (EATCS)200894181-2041169.03352
[25]
Khoussainov B, Nies A, Rubin S, and Stephan FAutomatic structures: richness and limitationsLog. Methods Comput. Sci., (Special issue: Conference “Logic in Computer Science 2004”)200422181128.03028
[26]
Khoussainov, B., Rubin, S., Stephan, F.: On automatic partial orders. In: Proceedings of LICS ’03, pp. 168–177 (2003)
[27]
Khoussainov B and Nerodel A Automata theory and its applications, volume 21 of Progress in Computer Science and Applied Logic 2001 Boston Birkhäuser Boston, Inc.
[28]
Khoussainov B and Rubin SGraphs with automatic presentations over a unary alphabetJ. Autom. Lang. Comb.20016467-48018970550997.68074
[29]
Kuske D, Liu J, and Lohrey MThe isomorphism problem on classes of automatic structures with transitive relationsTrans. Amer. Math. Soc.20133655103-51513074369
[30]
Liu J and Minnes MDeciding the isomorphism problem in classes of unary automatic structuresTheor. Comput. Sci.2011412181705-17172810212
[31]
Melnikov, A., Ng, K.M.: The back-and-forth method and computability without delay. Isreal J. Math., To appear
[32]
Rabin MODecidability of second-order theories and automata on infinite treesTrans. Amer. Math. Soc.19691411-352467600221.02031
[33]
Soare, R. I.: Recursively enumerable sets and degrees. Springer, Berlin (1987)
Index Terms
- Effective Categoricity of Automatic Equivalence and Nested Equivalence Structures
Index terms have been assigned to the content through auto-classification.
Recommendations
$\Sigma^0_1$ and $\Pi^0_1$ Equivalence Structures
CiE '09: Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational PracticeWe study computability theoretic properties of $\Sigma _{1}^{0}$ and $\Pi _{1}^{0}$ equivalence structures and how they differ from computable equivalence structures or equivalence structures that belong to the Ershov difference hierarchy. Our ...
Degrees of bi-embeddable categoricity of equivalence structures
AbstractWe study the algorithmic complexity of embeddings between bi-embeddable equivalence structures. We define the notions of computable bi-embeddable categoricity, (relative) bi-embeddable categoricity, and degrees of bi-embeddable categoricity. ...
Semiautomatic Structures
Semiautomatic structures generalise automatic structures in the sense that for some of the relations and functions in the structure one only requires the derived relations and functions are automatic when all but one input are filled with constants. One ...
Comments
Information & Contributors
Information
Published In
© Springer Science+Business Media, LLC, part of Springer Nature 2020.
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 01 August 2020
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 03 Jan 2025
Other Metrics
Citations
Cited By
View all- Krogman RCenzer D(2021)Complexity and Categoricity of Injection Structures Induced by Finite State TransducersConnecting with Computability10.1007/978-3-030-80049-9_10(106-119)Online publication date: 5-Jul-2021