759 search results - page 37 / 152 » Odometers on Regular Languages |
CAV
2010
Springer
15 years 1 months ago
2010
Springer
We show a new and constructive proof of the following language-theoretic result: for every context-free language L, there is a bounded context-free language L L which has the same...
FSTTCS
2008
Springer
14 years 11 months ago
2008
Springer
We consider the construction of finite automata from their corresponding regular expressions by a series of digraph-transformations along the expression’s structure. Each interm...
AML
2008
14 years 8 months ago
2008
Abstract. This paper develops the model theory of ordered structures that satisfy Keisler's regularity scheme, and its strengthening REF(L) (the reflection scheme) which is an...
FSTTCS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Message sequence charts (MSCs) are commonly used to specify interactions between agents in communicating systems. Their visual nature makes them attractive for describing...
116
click to vote
PODS
2010
ACM
15 years 3 months ago
2010
ACM
For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.)...