Abstract
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 a Finite State Transducer (abbreviated FST) injection structure if $A$ is a regular set, i.e. the set of words accepted by some finite automaton, and $f$ is realized by a deterministic FST. We study the complexity of the character of an FST injection structure. We examine the effective categoricity of such structures. We show that the isomorphism problem for unary FST structures is decidable in quadratic time.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.