303 search results - page 20 / 61 » Automata on Gauss Words |
93
Voted
IPL
2007
15 years 9 days ago
2007
We present a new proof of PSPACE-hardness of the emptiness problem for alternating finite automata with a singleton alphabet. This result was shown by Holzer (1995) who used a pr...
151
click to vote
ATAL
2008
Springer
15 years 2 months ago
2008
Springer
In open multi-agent systems (MASs) we cannot assume agents to be developed in a centralized fashion. Recent proposals of commitmentbased communication frameworks aim at increasing ...
93
Voted
STACS
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. A new class of languages of infinite words is introduced, called the maxregular languages, extending the class of ω-regular languages. The class has two equivalent desc...
84
Voted
CSL
2004
Springer
15 years 7 days ago
2004
Springer
Abstract. A new class of languages of infinite words is introduced, called the maxregular languages, extending the class of -regular languages. The class has two equivalent descrip...
139
click to vote
SIAMREV
2010
14 years 7 months ago
2010
In this paper we propose and analyze a Stochastic-Collocation method to solve elliptic Partial Differential Equations with random coefficients and forcing terms (input data of the...