1052 search results - page 62 / 211 » The Regular Real-Time Languages |
123
Voted
AAI
2000
15 years 3 months ago
2000
: As Virtual Environments applications become more complex, there is a need to interpret user interaction in terms of high-level concepts. In this paper, we investigate the relatio...
129
Voted
ENGL
2007
15 years 3 months ago
2007
In this paper we introduce a finite automaton called partial finite automaton to recognize partial languages. We have defined three classes of partial languages, viz., local pa...
132
Voted
WCRE
2003
IEEE
15 years 8 months ago
2003
IEEE
In reverse engineering, parsing may be partially done to extract lightweight source models. Parsing code containing preprocessing directives, syntactical errors and embedded langu...
150
click to vote
ACL
2007
15 years 5 months ago
2007
This paper presents a comparative study of five parameter estimation algorithms on four NLP tasks. Three of the five algorithms are well-known in the computational linguistics com...
116
Voted
CSL
2007
Springer
15 years 9 months ago
2007
Springer
We define regular expressions for unranked trees (actually, ordered sequences of unranked trees, called forests). These are compared to existing regular expressions for trees. On ...