LATA
2009
Springer
13 years 11 months ago
2009
Springer
We consider a restricted variant of the hairpin completion called bounded hairpin completion. The hairpin completion is a formal operation inspired from biochemistry. Applied to a ...
LATA
2009
Springer
13 years 11 months ago
2009
Springer
LATA
2009
Springer
13 years 11 months ago
2009
Springer
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...
LATA
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. In this paper we prove the following result. Let s be an infinite word on a finite alphabet, and N ≥ 0 be an integer. Suppose that all left special factors of s longe...
LATA
2009
Springer
13 years 11 months ago
2009
Springer
LATA
2009
Springer
13 years 11 months ago
2009
Springer
This paper proposes an alternative approach to the standard notion of rational (or regular) expression for tree languages. The main difference is that in the new notion we have on...
LATA
2009
Springer
13 years 11 months ago
2009
Springer
LATA
2009
Springer
13 years 11 months ago
2009
Springer
LATA
2009
Springer
13 years 11 months ago
2009
Springer
We propose an algorithm that given as input a full word w of length n, and positive integers p and d, outputs (if any exists) a maximal p-periodic partial word contained in w with ...
LATA
2009
Springer
13 years 11 months ago
2009
Springer
We present conditions which guarantee that a composition of marker cellular automata has the same neighbourhood as each of the individual components. We show that, under certain te...