Abstract. XML documents are described by a document type definition (DTD). An XML-grammar is a formal grammar that captures the syntactic features of a DTD. We investigate properti...
Abstract. A binary sequence A = A(0)A(1) . . . is called infinitely often (i.o.) Turing-autoreducible if A is reducible to itself via an oracle Turing machine that never queries it...
In this paper we investigate the periodic structure of rich words (i.e., words having the highest possible number of palindromic factors), giving new results relating them with per...
We introduce explicit fusions of names. To `fuse' two names is to declare that they may be used interchangeably. An explicit fusion is one that can exist in parallel with som...