MFCS
2000
Springer
13 years 11 months ago
2000
Springer
MFCS
2000
Springer
13 years 11 months ago
2000
Springer
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...
MFCS
2000
Springer
13 years 11 months ago
2000
Springer
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...
MFCS
2000
Springer
13 years 11 months ago
2000
Springer
MFCS
2000
Springer
13 years 11 months ago
2000
Springer
MFCS
2000
Springer
13 years 11 months ago
2000
Springer
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...
MFCS
2000
Springer
13 years 11 months ago
2000
Springer
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...
RTA
1998
Springer
13 years 11 months ago
1998
Springer
IFIPTCS
2000
13 years 11 months ago
2000
Hierarchical state machines are finite state machines whose states themselves can be other machines. In spite of their popularity in many modeling tools for software design, very l...
IFIPTCS
2000
13 years 11 months ago
2000
Over the years coding theory and complexity theory have benefited from a number of mutually enriching connections. This article focuses on a new connection that has emerged betwee...