759 search results - page 94 / 152 » Odometers on Regular Languages |
159
click to vote
RTA
2005
Springer
15 years 10 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...
145
Voted
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...
109
Voted
LREC
2008
15 years 6 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...
126
Voted
DLT
2006
15 years 6 months ago
2006
We investigate the following lower bound methods for regular languages: The fooling set technique, the extended fooling set technique, and the biclique edge cover technique. It is ...
152
click to vote
FSTTCS
2010
Springer
15 years 2 months ago
2010
Springer
We consider the problem of model checking message-passing systems with real-time requirements. As behavioural specifications, we use message sequence charts (MSCs) annotated with ...