762 search results - page 93 / 153 » Intercode Regular Languages |
118
Voted
ECOOP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. In many domains, classes have highly regular internal structure. For example, so-called business objects often contain boilerplate code for mapping database fields to cl...
152
click to vote
PPSWR
2005
Springer
15 years 9 months ago
2005
Springer
The CTTN-system is a computer program which provides advanced processing or temporal notions. The basic data structures of the CTTN-system are time points, crisp and fuzzy time int...
153
click to vote
RTA
2005
Springer
15 years 9 months ago
2005
Springer
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...
143
click to vote
CONCUR
2006
Springer
15 years 6 months ago
2006
Springer
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...
108
click to vote
LREC
2008
15 years 5 months ago
2008
We describe a web-based corpus query system, Glossa, which combines the expressiveness of regular query languages with the user-friendliness of a graphical interface. Since corpus...