On implementing recognizable transductions

DOI10.1080/00207160801968754zbMath1185.68432OpenAlexW1990426193MaRDI QIDQ5852138

Stavros Konstantinidis, Nicolae 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 distancetransduceredit stringrecognizable transductionedit languagesaturated transducer

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On Relations Defined by Generalized Finite Automata
• EDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS

This page was built for publication: On implementing recognizable transductions