1222 search results - page 11 / 245 » Some Results on Directable Automata |
FSTTCS
2001
Springer
14 years 28 days ago
2001
Springer
Abstract. This paper addresses the state explosion problem in automata based LTL model checking. To deal with large space requirements we turn to use a distributed approach. All th...
TSMC
2010
13 years 3 months ago
2010
The cellular learning automaton (CLA), which is a4 combination of cellular automaton (CA) and learning automaton5 (LA), is introduced recently. This model is superior to CA because...
STRINGOLOGY
2008
13 years 10 months ago
2008
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic by Kamp's theore...
TSMC
2002
13 years 8 months ago
2002
Automata models of learning systems introduced in the 1960s were popularized as learning automata (LA) in a survey paper in 1974 [1]. Since then, there have been many fundamental a...