Publication:5313794
From MaRDI portal
zbMath1098.68072MaRDI QIDQ5313794
Lila Kari, Stavros Konstantinidis
Publication date: 1 September 2005
68Q45: Formal languages and automata
Related Items
State Complexity of Neighbourhoods and Approximate Pattern Matching, Descriptional Complexity of Error Detection, State Complexity of Suffix Distance, DNA Coding Using the Subword Closure Operation, Quasi-Distances and Weighted Finite Automata, Closest substring problems for regular languages, Approximate matching between a context-free grammar and a finite-state automaton, Decidability of involution hypercodes, Efficient algorithms for computing the inner edit distance of a regular language via transducers, State complexity of prefix distance, Computing the edit distance of a regular language, Prefix Distance Between Regular Languages, State Complexity of Prefix Distance, Edit-Distance Between Visibly Pushdown Languages, On the Size of Two-Way Reasonable Automata for the Liveness Problem, State Complexity of Neighbourhoods and Approximate Pattern Matching