371 search results - page 6 / 75 » Partition Theorems and Computability Theory |
CONCUR
2008
Springer
13 years 8 months ago
2008
Springer
A well-known theorem in automata theory states that every context-free language is accepted by a pushdown automaton. We investigate this theorem in the setting of processes, using ...
SIGACT
2008
13 years 7 months ago
2008
Two long-open problems have been solved: (1) every sufficiently large planar point set in general position contains the vertices of an empty hexagon; (2) every finite collection o...
DM
1999
13 years 6 months ago
1999
Mosaics are orbits of partitions arising from music theoretical investigations. Various theorems from the field of "enumeration under finite group actions" are applied f...
SMI
2003
IEEE
14 years 8 days ago
2003
IEEE
Partitioning is a fundamental operation on graphs. In this paper we briefly review the basic concepts of graph partitioning and its relationship to digital mesh processing. We als...
AIME
2003
Springer
14 years 8 days ago
2003
Springer
The theory of granular partitions (TGP) is a new approach to the understanding of ontologies and other classificatory systems. The paper explores the use of this new theory in the ...