759 search results - page 83 / 152 » Odometers on Regular Languages |
LTCONF
2007
Springer
15 years 4 months ago
2007
Springer
To add to WordNet's contents, and specifically to aid automatic reasoning with WordNet, we classify and label the current relations among derivationally and semantically rela...
SAC
1994
ACM
15 years 2 months ago
1994
ACM
In this paper, the interest of fuzzy sets and possibility theory in the context of databases is presented. It is shown that these " notions provide an homogeneous framework f...
ICALP
1997
Springer
15 years 1 months ago
1997
Springer
In this paper we develop a new elementary algorithm for model-checking infinite sequential processes, including context-free processes, pushdown processes, and regular graphs, tha...
112
click to vote
CONCUR
2008
Springer
14 years 11 months ago
2008
Springer
A well-known theorem in automata theory states that every context-free language is accepted by a pushdown automaton. We investigate this theorem in the setting of processes, using ...
ANLP
2000
14 years 11 months ago
2000
We compare the asymptotic time complexity of left-to-right and bidirectional parsing techniques for bilexical context-free grammars, a grammar formalis an abstraction of language ...