198 search results - page 1 / 40 » Learning Unary Automata |
103
click to vote
JALC
2007
15 years 28 days 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...
95
Voted
LATIN
2010
Springer
15 years 5 months ago
2010
Springer
105
click to vote
JUCS
2002
15 years 21 days 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...
152
Voted
AUTOMATICA
2008
14 years 11 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...
103
Voted
CSL
2006
Springer
15 years 4 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...