On implementing recognizable transductions

DOI10.1080/00207160801968754MaRDI QIDQ5852138zbMATH OpenOpenAlexFDO

Authors Stavros Konstantinidis, N. Sântean, Sheng Yu

Publication date 26 January 2010

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207160801968754

zbMATH Keywords

edit distanceedit languageedit stringrecognizable transductionsaturated transducertransducer

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Descriptive complexity and finite models (68Q19) Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Recommendations

• Finite transducers and rational transductions
• scientific article; zbMATH DE number 1773097
• A topological approach to transductions
• Minimizing subsequential transducers: a survey.
• Minimization algorithms for sequential transducers

Cites work

• EDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS
• scientific article; zbMATH DE number 3660804 (Why is no real title available?)
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• scientific article; zbMATH DE number 3552814 (Why is no real title available?)
• scientific article; zbMATH DE number 1516705 (Why is no real title available?)
• On Relations Defined by Generalized Finite Automata

Cited in

(2)

• scientific article; zbMATH DE number 1452986 (Why is no real title available?)
• On the difference set of two transductions

This page was built for publication: On implementing recognizable transductions

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