3 search results - page 1 / 1 » Context-Sensitive Languages, Rational Graphs and Determinism |
CORR
2006
Springer
13 years 5 months ago
2006
Springer
We investigate families of infinite automata for context-sensitive languages. An infinite automaton is an infinite labeled graph with two sets of initial and final vertices. Its la...
MFCS
2001
Springer
13 years 10 months ago
2001
Springer
This paper shows that the traces of rational graphs coincide with the context-sensitive languages.
NIPS
2003
13 years 7 months ago
2003
We describe a pattern acquisition algorithm that learns, in an unsupervised fashion, a streamlined representation of linguistic structures from a plain natural-language corpus. Th...