ITA
2000
13 years 11 months ago
2000
We consider the multiparty communication model de ned in 4] using the formalism from 8]. First, we correct an inaccuracy in the proof of the fundamental result of 6] providing a lo...
ITA
2000
13 years 11 months ago
2000
Fine and Wilf's theorem has recently been extended to words having three periods. Following the method of the authors we extend it to an arbitrary number of periods and deduce...
ITA
2007
13 years 11 months ago
2007
Duplication is the replacement of a factor w within a word by ww. This operation can be used iteratively to generate languages starting from words or sets of words. By undoing dupl...
ITA
2007
13 years 11 months ago
2007
: For polyominoes coded by their boundary word, we describe a quadratic O(n2) algorithm in the boundary length n which improves the naive O(n4) algorithm. Techniques used emanate f...
ITA
2007
13 years 11 months ago
2007
ITA
2007
13 years 11 months ago
2007
Abstract. Various static analyses of functional programming languages that permit infinite data structures make use of set constants like Top, Inf, and Bot, denoting all terms, al...
ITA
2007
13 years 11 months ago
2007
ITA
2007
13 years 11 months ago
2007
Abstract For finitary set functors preserving inverse images several concepts of coalgebras A are proved to be equivalent: (i) A has a homomorphism into the initial algebra, (ii) ...
ITA
2007
13 years 11 months ago
2007
ITA
2007
13 years 11 months ago
2007
We study the problem of learning regular tree languages from text. We show that the framework of function distinguishability as introduced by the author in Theoretical Computer Sc...