35 search results - page 2 / 7 » lata 2009 |
LATA
2009
Springer
14 years 3 days ago
2009
Springer
LATA
2009
Springer
14 years 3 days ago
2009
Springer
LATA
2009
Springer
14 years 3 days ago
2009
Springer
Deciding whether a finite set of polyominoes tiles the plane is undecidable by reduction from the Domino problem. In this paper, we prove that the problem remains undecidable if t...
LATA
2009
Springer
14 years 3 days ago
2009
Springer
Abstract. Glushkov’s algorithm builds an ε-free nondeterministic automaton from a given regular expression. In the worst case, its number of states is linear and its number of t...
LATA
2009
Springer
14 years 3 days ago
2009
Springer
In this paper we survey some results in inductive inference showing how learnability of a class of languages may depend on hypothesis space chosen. We also discuss results which co...