759 search results - page 41 / 152 » Odometers on Regular Languages |
STACS
2004
Springer
15 years 3 months ago
2004
Springer
An Active Context-Free Game is a game with two players (Romeo and Juliet) on strings over a finite alphabet. In each move, Juliet selects a position of the current word and Romeo ...
ICGI
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. The computation of the probability of string generation according to stochastic grammars given only some of the symbols that compose it underlies pattern recognition prob...
NIPS
2004
14 years 11 months ago
2004
Many works have shown that strong connections relate learning from examples to regularization techniques for ill-posed inverse problems. Nevertheless by now there was no formal ev...
DAM
2007
14 years 10 months ago
2007
We use syntactic monoid methods, together with an enhanced pumping lemma, to investigate the structure of splicing languages. We obtain an algorithm for deciding whether a regular...
CAI
2009
Springer
15 years 4 months ago
2009
Springer
The aim of this paper is to collect definitions and results on the main classes of 2D languages introduced with the attempt of generalizing regular and context-free string languag...