The isomorphism problem for FST injection structures

DOI10.1007/978-3-030-93100-1_3OpenAlexW4200388528MaRDI QIDQ2151392

Douglas Cenzer, Richard Krogman

Publication date: 1 July 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-93100-1_3

zbMATH Keywords

computability theoryautomatic structuresfinite state automatafinite state transducersinjection structures

Mathematics Subject Classification ID

Logic in computer science (03B70)

Cites Work

• Unnamed Item
• Model-theoretic complexity of automatic structures
• \(\Sigma_1^0\) and \(\Pi_1^0\) equivalence structures
• Finite presentations of infinite structures: Automata and interpretations
• Complexity and categoricity of injection structures induced by finite state transducers
• Computability-theoretic properties of injection structures
• Deciding the isomorphism problem in classes of unary automatic structures
• Effective categoricity of equivalence structures
• The isomorphism problem on classes of automatic structures with transitive relations
• Injection Structures Specified by Finite State Transducers
• Unary automatic graphs: an algorithmic perspective
• Automatic linear orders and trees
• Automatic Structures: Richness and Limitations
• Automatic presentations of structures

This page was built for publication: The isomorphism problem for FST injection structures