198 search results - page 1 / 40 » Learning Unary Automata |
JALC
2007
13 years 4 months ago
2007
We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be app...
LATIN
2010
Springer
13 years 9 months ago
2010
Springer
JUCS
2002
13 years 4 months ago
2002
Abstract: In this paper we introduce the concept of the quasi-product of tree automata. In a quasi-product the inputs of the component tree automata are operational symbols in whic...
AUTOMATICA
2008
13 years 3 months ago
2008
Cellular learning automata is a combination of cellular automata and learning automata. The synchronous version of cellular learning automata in which all learning automata in dif...
CSL
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. Expansions of the natural number ordering by unary predicates are studied, using logics which in expressive power are located between first-order and monadic second-order...