4743 search results - page 490 / 949 » The PlusCal Algorithm Language |
124
Voted
LICS
2009
IEEE
15 years 10 months ago
2009
IEEE
In this paper we introduce “clipping,” a new method of syntactic approximation which is motivated by and works in conjunction with a sound and decidable denotational model for...
126
Voted
WIA
2009
Springer
15 years 10 months ago
2009
Springer
FAdo is an ongoing project which aims to provide a set of tools for symbolic manipulation of formal languages. To allow highlevel programming with complex data structures, easy pro...
116
click to vote
MFCS
2009
Springer
15 years 10 months ago
2009
Springer
The concept of determinism, while clear and well assessed for string languages, is still matter of research as far as picture languages are concerned. We introduce here a new kind ...
140
click to vote
NLDB
2007
Springer
15 years 9 months ago
2007
Springer
Information retrieval needs to match relevant texts with a given query. Selecting appropriate parts is useful when documents are long, and only portions are interesting to the user...
99
Voted
ACMSE
2006
ACM
15 years 9 months ago
2006
ACM
Classic results in the theory of regular languages show that the problem of converting an NFA (nondeterministic finite automaton) into a minimal equivalent NFA is NP-hard, even f...