Applications of transducers in independent languages, word distances, codes

DOI10.1007/978-3-319-60252-3_4zbMath1489.68127OpenAlexW2620926566MaRDI QIDQ2400988

Stavros Konstantinidis

Publication date: 31 August 2017

Full work available at URL: https://hal.inria.fr/hal-01657012/file/440206_1_En_4_Chapter.pdf

zbMATH Keywords

algorithmsautomatamaximalitycodestransducersindependent languagesword distance

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

Zero-Avoiding Transducers, Length Separable Relations, and the Rational Asymmetric Partition Problem ⋮ Efficient algorithms for computing the inner edit distance of a regular language via transducers ⋮ Regular Expressions and Transducers Over Alphabet-Invariant and User-Defined Labels ⋮ A pumping lemma for regular closure of prefix-free languages ⋮ Theoretical and implementational aspects of the formal language server (LaSer)

This page was built for publication: Applications of transducers in independent languages, word distances, codes