1052 search results - page 137 / 211 » The Regular Real-Time Languages |
144
Voted
IANDC
2011
14 years 10 months ago
2011
We present a systematic way to generate (1) languages of (generalised) regular expressions, and (2) sound and complete axiomatizations thereof, for a wide variety of quantitative ...
135
Voted
AOSD
2007
ACM
15 years 7 months ago
2007
ACM
We define and study bisimulation for proving contextual equivalence in an aspect extension of the untyped lambda-calculus. To our knowledge, this is the first study of coinductive...
157
Voted
EDBT
2009
ACM
15 years 7 months ago
2009
ACM
The classic Generalized Sequential Patterns (GSP) algorithm returns all frequent sequences present in a database. However, usually a few ones are interesting from a user's po...
131
click to vote
JALC
2007
15 years 3 months ago
2007
We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be app...
136
Voted
OOPSLA
2005
Springer
15 years 9 months ago
2005
Springer
Our goal is to enable rapid production of static and dynamic object models from natural language description of problems. Rapid modeling is achieved through automation of analysis...