759 search results - page 88 / 152 » Odometers on Regular Languages |
IANDC
2011
14 years 4 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 ...
AOSD
2007
ACM
15 years 1 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...
112
click to vote
EDBT
2009
ACM
15 years 1 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...
JALC
2007
14 years 9 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...
LATA
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Iterated schemata allow to define infinite languages of propositional formulae through formulae patterns. Formally, schemata extend propositional logic with new (generali...