scientific article; zbMATH DE number 2201366
From MaRDI portal
Publication:5313794
zbMath1098.68072MaRDI QIDQ5313794
Lila Kari, Stavros Konstantinidis
Publication date: 1 September 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (16)
On the Size of Two-Way Reasonable Automata for the Liveness Problem ⋮ State Complexity of Neighbourhoods and Approximate Pattern Matching ⋮ Computing the edit distance of a regular language ⋮ State Complexity of Prefix Distance ⋮ Decidability of involution hypercodes ⋮ State Complexity of Neighbourhoods and Approximate Pattern Matching ⋮ Edit-Distance Between Visibly Pushdown Languages ⋮ Efficient algorithms for computing the inner edit distance of a regular language via transducers ⋮ Closest substring problems for regular languages ⋮ Descriptional Complexity of Error Detection ⋮ DNA Coding Using the Subword Closure Operation ⋮ State Complexity of Suffix Distance ⋮ Quasi-Distances and Weighted Finite Automata ⋮ Prefix Distance Between Regular Languages ⋮ Approximate matching between a context-free grammar and a finite-state automaton ⋮ State complexity of prefix distance
This page was built for publication:
