Abstract. This paper analyses the complexity of model checking Fixpoint Logic with Chop – an extension of the modal µ-calculus with a sequential composition operator. It uses tw...
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...
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...
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...