1052 search results - page 127 / 211 » The Regular Real-Time Languages |
123
click to vote
ANLP
2000
15 years 5 months ago
2000
We compare the asymptotic time complexity of left-to-right and bidirectional parsing techniques for bilexical context-free grammars, a grammar formalis an abstraction of language ...
117
click to vote
CORR
2008
Springer
15 years 3 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...
128
click to vote
TCS
2008
15 years 3 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...
206
Voted
SIGMOD
2008
ACM
16 years 3 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...
130
click to vote
AICT
2007
IEEE
15 years 10 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 ...