1705 search results - page 74 / 341 » Representing Constraints with Automata |
161
click to vote
DEBS
2009
ACM
15 years 10 months ago
2009
ACM
The nature of data in enterprises and on the Internet is changing. Data used to be stored in a database first and queried later. Today timely processing of new data, represented ...
129
click to vote
FSMNLP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Stochastic finite automata are useful for identifying substrings (chunks) within larger units of text. Relevant applications include tokenization, base-NP chunking, name...
136
click to vote
ITICSE
2004
ACM
15 years 9 months ago
2004
ACM
The use of generic and generative methods for the development and application of interactive educational software is a relatively unexplored area in industry and education. Advant...
125
click to vote
CICLING
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. This paper reports on the development of a finite state system for finding grammar errors without actually specifying the error. A corpus of Swedish text written by chi...
131
click to vote
LICS
1997
IEEE
15 years 7 months ago
1997
IEEE
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...