124
click to vote
FCT
15 years 8 months ago
2009 Springer 
We give small universal Turing machines with state-symbol pairs of (6, 2), (3, 3) and (2, 4). These machines are weakly universal, which means that they have an infinitely repeate...
112
click to vote
FCT
15 years 8 months ago
2009 Springer
We argue that closure operators are fundamental tools for the study of relationships between order structures and their sequence representations. We also propose and analyse a clos...
101
click to vote
FCT
15 years 8 months ago
2009 Springer 
Weighted automata are finite automata with numerical weights on transitions. Nondeterministic weighted automata define quantitative languages L that assign to each word w a real ...
107
click to vote
FCT
15 years 8 months ago
2009 Springer
We study the empire colouring problem (as defined by Percy Heawood in 1890) for maps whose dual planar graph is a tree, with empires formed by exactly r countries. We prove that, ...
|
Applied Computing