Complexity of injection structures induced by finite state transducers

DOI10.1093/LOGCOM/EXAC065OpenAlexW4307382118MaRDI QIDQ5872864FDOQ5872864

Authors Richard Krogman, Douglas Cenzer

Publication date 4 January 2023

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/logcom/exac065

zbMATH Keywords

automatic structurescomputability theoryfinite state automatafinite state transducersinjection structures

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

Recommendations

• Complexity and categoricity of injection structures induced by finite state transducers
• Injection Structures Specified by Finite State Transducers
• Finite-state complexity and the size of transducers
• Finite transducers and nondeterministic state complexity of regular languages
• The complexity of optimizing finite-state transducers
• Descriptional complexity of iterated uniform finite-state transducers
• Descriptional complexity of iterated uniform finite-state transducers
• Computability-theoretic properties of injection structures
• scientific article; zbMATH DE number 1045406
• Incomplete transition complexity of basic operations on finite languages

Cited in

(1)

• Injection Structures Specified by Finite State Transducers

This page was built for publication: Complexity of injection structures induced by finite state transducers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5872864)