Sciweavers

8 search results - page 2 / 2
» jalc 2008
Sort
View
JALC
2007
79views more  JALC 2007»
13 years 7 months ago
Two-Way Finite Automata with a Write-Once Track
The basic finite automata model has been extended over the years with different acceptance modes (nondeterminism, alternation), new or improved devices (two-way heads, pebbles, ...
Berke Durak
JALC
2007
109views more  JALC 2007»
13 years 7 months ago
A Family of NFAs Free of State Reductions
Merging states in finite automata is a main method of reducing the size of the representation of regular languages. The process has been extensively studied for deterministic fi...
Cezar Câmpeanu, Nicolae Santean, Sheng Yu
JALC
2007
90views more  JALC 2007»
13 years 7 months ago
Learning Unary Automata
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...
Gregor Gramlich, Ralf Herrmann