495 search results - page 21 / 99 » Automata and differentiable words |
74
Voted
IPL
2007
14 years 10 months 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...
133
Voted
ATAL
2008
Springer
15 years 4 days 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 ...
STACS
2009
Springer
15 years 5 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...
CSL
2004
Springer
14 years 10 months 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...
78
Voted
CORR
2008
Springer
14 years 12 months ago
2008
Springer
The goal of this paper is to show why the framework of communication complexity seems suitable for the study of cellular automata. Researchers have tackled different algorithmic p...