85 search results - page 14 / 17 » Partial Higher-dimensional Automata |
ISTA
2003
14 years 11 months ago
2003
: Development of distributed systems is complicated by the absence of reliable global timing, concurrency, and nondeterminism. To deal with these obstacles log files are produced b...
DAM
2008
14 years 9 months ago
2008
A mobile agent (robot), modeled as a finite automaton, has to visit all nodes of a regular graph. How does the memory size of the agent (the number of states of the automaton) inf...
100
click to vote
CORR
2007
Springer
14 years 9 months ago
2007
Springer
We study the existence of automatic presentations for various algebraic structures. An automatic presentation of a structure is a description of the universe of the structure by a...
ANCS
2007
ACM
15 years 1 months ago
2007
ACM
The importance of network security has grown tremendously and a collection of devices have been introduced, which can improve the security of a network. Network intrusion detectio...
IJFCS
2007
14 years 9 months ago
2007
We investigate deterministically simulating (i.e., solving the membership problem for) nondeterministic finite automata (NFA), relying solely on the NFA’s resources (states and...