759 search results - page 63 / 152 » Odometers on Regular Languages |
CORR
2011
Springer
14 years 5 months ago
2011
Springer
Abstract The class of ω-regular languages provide a robust specification language in verification. Every ω-regular condition can be decomposed into a safety part and a liveness...
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
We propose a new approach to the notion of recognition, which departs from the classical definitions by three specific features. First, it does not rely on automata. Secondly, it...
ICALP
2001
Springer
15 years 2 months ago
2001
Springer
Formal power series are an extension of formal languages. Recognizable formal power series can be captured by the so-called weighted finite automata, generalizing finite state ma...
111
click to vote
ODBIS
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. RDF Schema (RDFS) extends RDF with a schema vocabulary with a predefined semantics. Evaluating queries which involve this vocabulary is challenging, and there is not yet...
ENTCS
2006
14 years 10 months ago
2006
Context and sequence variables allow matching to explore term-trees both in depth and in breadth. It makes context sequence matching a suitable computational mechanism for a rule-...