759 search results - page 84 / 152 » Odometers on Regular Languages |
CORR
2008
Springer
14 years 10 months ago
2008
Springer
There exist very lucid explanations of the combinatorial origins of rational and algebraic functions, in particular with respect to regular and context free languages. In the searc...
TCS
2008
14 years 9 months ago
2008
We study the computational power of pure insertion grammars. We show that pure insertion grammars of weight 3 can characterize all recursively enumerable languages. This is achiev...
151
click to vote
SIGMOD
2008
ACM
15 years 10 months ago
2008
ACM
We present SchemaScope, a system to derive Document Type Definitions and XML Schemas from corpora of sample XML documents. Tools are provided to visualize, clean, and refine exist...
AICT
2007
IEEE
15 years 4 months ago
2007
IEEE
—The topic of policy-based management is introduced. Its specific application by the ACCENT project to call control is then discussed. The APPEL policy language supports regular ...
MFCS
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. We define the notion of height-deterministic pushdown automata, a model where for any given input string the stack heights during any (nondeterministic) computation on t...