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...
: 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...
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...
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) ...
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...
This note is about functions f : Aω → Bω whose graph is recognized by a B¨uchi finite automaton on the product alphabet A × B. These functions are Baire class 2 in the Bair...