scientific article; zbMATH DE number 5201365
From MaRDI portal
Publication:5422230
zbMath1258.68074MaRDI QIDQ5422230
Kai Salomaa, Cristian S. Calude, Sheng Yu
Publication date: 17 October 2007
Full work available at URL: http://www.jucs.org/jucs_8_2/additive_distances_and_quasi
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (16)
State Complexity of Neighbourhoods and Approximate Pattern Matching ⋮ Duplications and Pseudo-Duplications ⋮ State Complexity of Prefix Distance ⋮ Topologies for error-detecting variable-length codes ⋮ State Complexity of Neighbourhoods and Approximate Pattern Matching ⋮ On the existence of regular approximations ⋮ Consensus String Problem for Multiple Regular Languages ⋮ Closest substring problems for regular languages ⋮ Descriptional Complexity of Error Detection ⋮ State Complexity of Suffix Distance ⋮ Consensus string problem for multiple regular languages ⋮ Topology on words ⋮ On the similarity metric and the distance metric ⋮ Quasi-Distances and Weighted Finite Automata ⋮ State Complexity of Prefix Distance of Subregular Languages ⋮ State complexity of prefix distance
This page was built for publication:
