206 search results - page 11 / 42 » Weak Alternating Automata Are Not That Weak |
IJCAI
1989
13 years 8 months ago
1989
One of the weak points of the present critics of AI is their lack of an alternative cognitive theory. In the paper the outline of such a theory is sketched, based on (one reading)...
ICALP
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. This paper studies the expressive power of finite-state automata recognizing sets of real numbers encoded positionally. It is known that the sets that are definable in th...
CAV
1999
Springer
13 years 12 months ago
1999
Springer
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
ACL
1997
13 years 9 months ago
1997
In this paper we describe an approach to constraint based syntactic theories in terms of finite tree automata. The solutions to constraints expressed in weak monadic second order ...
CHARME
2003
Springer
13 years 11 months ago
2003
Springer
Industrial verification teams are actively developing suitable event sequence languages for hardware verification. Such languages must be expressive, designer friendly, and hardwar...