346 search results - page 44 / 70 » Determinizing Asynchronous Automata |
MFCS
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. Visibly pushdown transducers (VPTs) form a strict subclass of pushdown transducers (PTs) that extends finite state transducers with a stack. Like visibly pushdown automa...
CORR
2011
Springer
14 years 1 months ago
2011
Springer
Complementation of finite automata on infinite words is not only a fundamental problem in automata theory, but also serves as a cornerstone for solving numerous decision problem...
ATVA
2011
Springer
13 years 10 months ago
2011
Springer
In [AKL10], we showed how viewing online algorithms as reactive systems enables the application of ideas from formal verification to the competitive analysis of online algorithms....
WDAG
2007
Springer
15 years 4 months ago
2007
Springer
A group of identical mobile agents moving asynchronously among the nodes of an anonymous network have to gather together in a single node of the graph. This problem known as the (a...
ITC
2003
IEEE
15 years 3 months ago
2003
IEEE
When developing new designs, debugging the prototype is important to resolve application malfunction. During this board design debug, often a few pins of an IC are measured to che...