346 search results - page 26 / 70 » Determinizing Asynchronous Automata |
TACAS
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. Checking for language containment between nondeterministic ω-automata is a central task in automata-based hierarchical verification. We present a symbolic procedure for...
CORR
2009
Springer
14 years 7 months ago
2009
Springer
The minimal deterministic finite automaton is generally used to determine regular languages equality. Using Brzozowski's notion of derivative, Antimirov and Mosses proposed a...
STACS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. In this paper we determine some limit distributions of pattern statistics in rational stochastic models, defined by means of nondeterministic weighted finite automata. ...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
For applications to cryptography, it is important to represent numbers with a small number of non-zero digits (Hamming weight) or with small absolute sum of digits. The problem of ...
FUIN
2008
14 years 10 months ago
2008
The behavior of rational selfish agents has been classically studied in the framework of strategic games in which each player has a set of possible actions, players choose actions ...