Abstract
An injection structure \({\mathcal A}= (A,f)\) is a set A together with a one-place one-to-one function f. \({\mathcal A}\) is an FST injection structure if A is a regular set, that is, the set of words accepted by some finite automaton, and f is realized by a finite-state transducer. We initiate the study of FST injection structures. We show that the model checking problem for FST injection structures is undecidable which contrasts with the fact that the model checking problem for automatic relational structures is decidable. We also explore which isomorphisms types of injection structures can be realized by FST injections. For example, we completely characterize the isomorphism types that can be realized by FST injection structures over a unary alphabet. We show that any FST injection structure is isomorphic to an FST injection structure over a binary alphabet. We also prove a number of positive and negative results about the possible isomorphism types of FST injection structures over an arbitrary alphabet.
Buss was partially supported by NSF grants DMS-1101228 and CCF-1213151. Cenzer was partially supported by the NSF grant DMS-1101123. Minnes was partially supported by the NSF grant DMS-1060351.
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
Bennett, C.H.: Logical reversibility of computation. IBM J. Res. Dev. 17, 525–532 (1973)
Ash, C., Knight, J.: Computable Structures and the Hyperarithmetical Hierarchy. Elsevier, Amsterdam (2000)
Blumensath, A.: Automatic structures. Diploma Thesis, RWTH Aachen (1999)
Blumensath, A., Grädel, E.: Automatic structures. In: Proceedings of the 15th LICS, pp. 51–62 (2000)
Cenzer, D., Harizanov, V., Remmel, J.B.: Effective categoricity of injection structures. In: Löwe, B., Normann, D., Soskov, I., Soskova, A. (eds.) CiE 2011. LNCS, vol. 6735, pp. 51–60. Springer, Heidelberg (2011). doi:10.1007/978-3-642-21875-0_6
Cenzer, D., Harizanov, V., Remmel, J.B.: Computability-theoretic properties of injection structures. In: Algebra and Logic (to appear)
Delhommé, C.: Automaticité des ordinaux et des graphes homogènes. C.R. Acadèmie des sciences Paris, Ser. I 339, 5–10 (2004)
Hodgson, B.R.: On direct products of automaton decidable theories. Theoret. Comput. Sci. 19, 331–335 (1982). North-Holland
Khoussainov, B., Nerode, A.: Automatic presentations of structures. In: Leivant, D. (ed.) LCC 1994. LNCS, vol. 960, pp. 367–392. Springer, Heidelberg (1995). doi:10.1007/3-540-60178-3_93
Khoussainov, B., Shore, R.A.: Effective model theory: the number of models and their complexity. In: Cooper, S.B., Truss, J.K. (eds.) Models and Computability, Invited Papers from LC 1997, LMSLNS vol. 259, pp. 193–240, Cambridge University Press, Cambridge (1999)
Khoussainov, B., Rubin, S., Stephan, F.: On automatic partial orders. In: Proceedings of the 18th LICS, pp. 168–177 (2003)
Khoussainov, B., Nies, A., Rubin, S., Stephan, F.: Automatic structures: richness and limitations. In: Proceedings of the 19th LICS, pp. 44–53 (2004)
Khoussainov, B., Rubin, S., Stephan, F.: Automatic linear orders and trees. ACM Trans. Comput. Logic 6(4), 675–700 (2005)
Khoussainov, B., Liu, J., Minnes, M.: Unary automatic graphs: an algorithmic perspective. In: Agrawal, M., Du, D., Duan, Z., Li, A. (eds.) TAMC 2008. LNCS, vol. 4978, pp. 542–553. Springer, Heidelberg (2008). doi:10.1007/978-3-540-79228-4_47
Rubin, S.: Automatic structures. Ph.D. Thesis, University of Auckland (2004)
Soare, R.I.: Recursively Enumerable Sets and Degrees. Springer, Berlin (1987)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this chapter
Cite this chapter
Buss, S., Cenzer, D., Minnes, M., Remmel, J.B. (2017). Injection Structures Specified by Finite State Transducers. In: Day, A., Fellows, M., Greenberg, N., Khoussainov, B., Melnikov, A., Rosamond, F. (eds) Computability and Complexity. Lecture Notes in Computer Science(), vol 10010. Springer, Cham. https://doi.org/10.1007/978-3-319-50062-1_24
Download citation
DOI: https://doi.org/10.1007/978-3-319-50062-1_24
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-50061-4
Online ISBN: 978-3-319-50062-1
eBook Packages: Computer ScienceComputer Science (R0)