744 search results - page 80 / 149 » Observations on the Decidability of Transitions |
SOFSEM
2007
Springer
14 years 3 months ago
2007
Springer
We investigate deterministically simulating (i.e., solving the membership problem for) nondeterministic finite automata (NFA), relying solely on the NFA’s resources (states and ...
CICLING
2003
Springer
14 years 2 months ago
2003
Springer
A new sort of generative grammar (Sec2) will be demonstrated which is more radically “lexicalist” than any earlier one (Sec1). It is a modified Unification Categorial Gramma...
LATA
2010
Springer
14 years 1 months ago
2010
Springer
Automated reasoning about systems with infinite domains requires an extension of regular automata to infinite alphabets. Existing formalisms of such automata cope with the infinite...
ICDCS
2010
IEEE
14 years 1 months ago
2010
IEEE
—We propose a steepest descent method to compute optimal control parameters for balancing between multiple performance objectives in stateless stochastic scheduling, wherein the ...
COORDINATION
2008
Springer
13 years 11 months ago
2008
Springer
We present the -calculus, a process calculus for formally modeling and reasoning about Mobile Ad Hoc Wireless Networks (MANETs) and their protocols. The -calculus naturally capture...