762 search results - page 64 / 153 » Intercode Regular Languages |
146
click to vote
DLT
2006
15 years 5 months ago
2006
Duplication is an operation generating a language from a single word by iterated application of rewriting rules u uu on factors. We extend this operation to entire languages and i...
163
click to vote
LICS
2009
IEEE
15 years 10 months ago
2009
IEEE
Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages L that assign to each word w a real number L(w). In ...
134
click to vote
ICALP
2010
Springer
15 years 9 months ago
2010
Springer
We propose a new approach to the notion of recognition, which departs from the classical definitions by three specific features. First, it does not rely on automata. Secondly, it...
112
Voted
ICALP
2001
Springer
15 years 8 months ago
2001
Springer
Formal power series are an extension of formal languages. Recognizable formal power series can be captured by the so-called weighted finite automata, generalizing finite state ma...
166
click to vote
JMLR
2011
14 years 11 months ago
2011
A strong inductive bias is essential in unsupervised grammar induction. In this paper, we explore a particular sparsity bias in dependency grammars that encourages a small number ...