Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
CORR
2011
Springer
162views Education» more  CORR 2011»
9 years 9 months ago
Isomorphism of regular trees and words
The complexity of the isomorphism problem for regular trees, regular linear orders, and regular words is analyzed. A tree is regular if it is isomorphic to the prefix order on a r...
Markus Lohrey, Christian Mathissen
FUIN
2010
89views more  FUIN 2010»
10 years 1 months ago
Computing Maximal Error-detecting Capabilities and Distances of Regular Languages
Abstract. A (combinatorial) channel consists of pairs of words representing all possible inputoutput channel situations. In a past paper, we formalized the intuitive concept of “...
Stavros Konstantinidis, Pedro V. Silva
MST
2007
132views more  MST 2007»
10 years 2 months ago
Odometers on Regular Languages
Odometers or “adding machines” are usually introduced in the context of positional numeration systems built on a strictly increasing sequence of integers. We generalize this no...
Valérie Berthé, Michel Rigo
JUCS
2002
106views more  JUCS 2002»
10 years 2 months ago
Additive Distances and Quasi-Distances Between Words
: We study additive distances and quasi-distances between words. We show that every additive distance is finite. We then prove that every additive quasi-distance is regularity-pres...
Cristian Calude, Kai Salomaa, Sheng Yu
IPL
2007
105views more  IPL 2007»
10 years 2 months ago
A new algorithm for testing if a regular language is locally threshold testable
A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is sh...
Mikolaj Bojanczyk
IANDC
2007
117views more  IANDC 2007»
10 years 2 months ago
Computing the edit distance of a regular language
The edit distance (or Levenshtein distance) between two words is the smallest number of substitutions, insertions, and deletions of symbols that can be used to transform one of the...
Stavros Konstantinidis
MST
2006
105views more  MST 2006»
10 years 2 months ago
Selection Functions that Do Not Preserve Normality
The sequence selected from a sequence R(0)R(1) . . . by a language L is the subsequence of R that contains exactly the bits R(n + 1) such that the prefix R(0) . . . R(n) is in L. B...
Wolfgang Merkle, Jan Reimann
FUIN
2007
133views more  FUIN 2007»
10 years 2 months ago
Intercode Regular Languages
Intercodes are a generalization of comma-free codes. Using the structural properties of finite-state automata recognizing an intercode we develop a polynomial-time algorithm for d...
Yo-Sub Han, Kai Salomaa, Derick Wood
JALC
2008
72views more  JALC 2008»
10 years 2 months ago
Maximal Error-Detecting Capabilities of Formal Languages
A combinatorial channel is a set of pairs of words describing all the possible input-output channel situations. We introduce the concept "maximal error-detecting capability&q...
Stavros Konstantinidis, Pedro V. Silva
DLT
2006
10 years 4 months ago
Prime Decompositions of Regular Languages
We investigate factorizations of regular languages in terms of prime languages. A language is said to be strongly prime decomposable if any way of factorizing the language yields a...
Yo-Sub Han, Kai Salomaa, Derick Wood
books