516 search results - page 28 / 104 » Generalizing the Discrete Timed Automaton |
FUIN
2007
13 years 9 months ago
2007
Intercodes are a generalization of comma-free codes. Using the structural properties of finite-state automata recognizing an intercode we develop a polynomial-time algorithm for d...
CORR
2009
Springer
13 years 7 months ago
2009
Springer
The minimal deterministic finite automaton is generally used to determine regular languages equality. Using Brzozowski's notion of derivative, Antimirov and Mosses proposed a...
SIGADA
2007
Springer
14 years 4 months ago
2007
Springer
A system based on a hierarchical scheduler is a system in which the processor is shared between several collaborative schedulers. Such schedulers exist since 1960 and they are bec...
SIGSOFT
2008
ACM
13 years 9 months ago
2008
ACM
If an organization depends on the service quality provided by another organization it often enters into a bilateral service level agreement (SLA), which mitigates outsourcing risk...
COMPGEOM
2009
ACM
14 years 4 months ago
2009
ACM
We describe the first algorithms to compute minimum cuts in surface-embedded graphs in near-linear time. Given an undirected graph embedded on an orientable surface of genus g, w...