223 search results - page 21 / 45 » Construction of Tree Automata from Regular Expressions |
ESOP
2009
Springer
13 years 11 months ago
2009
Springer
We describe the mechanisation of SLR parsing, covering background properties of context-free languages and grammars, as well as the construction of an SLR automaton. Among the vari...
AFRIGRAPH
2006
ACM
14 years 1 months ago
2006
ACM
We present a simple technique for single-rate compression of point clouds sampled from a surface, based on a spanning tree of the points. Unlike previous methods, we predict futur...
QEST
2008
IEEE
14 years 1 months ago
2008
IEEE
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
PODS
2007
ACM
14 years 7 months ago
2007
ACM
The pebble tree automaton and the pebble tree transducer are enhanced by additionally allowing an unbounded number of `invisible' pebbles (as opposed to the usual `visible�...
ACTA
2010
13 years 7 months ago
2010
The IEEE standardized Property Specification Language, PSL for short, extends the well-known linear-time temporal logic LTL with so-called semi-extended regular expressions. PSL an...