35 search results - page 4 / 7 » Expressiveness and Closure Properties for Quantitative Langu... |
CAV
2012
Springer
12 years 7 days ago
2012
Springer
Nested-word automata (NWAs) are a language formalism that helps bridge the gap between finite-state automata and pushdown automata. NWAs can express some context-free properties, ...
ACTA
2007
13 years 10 months ago
2007
Abstract This paper introduces the notion of well-structured language. A wellstructured language can be defined by a labelled well-structured transition system, equipped with an u...
FROCOS
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. We propose a new class of tree automata, called tree automata with normalization (TAN). This framework extends equational tree automata, and improved the results of them:...
IROS
2007
IEEE
14 years 4 months ago
2007
IEEE
— A functional approach to programming robot swarms brings with it well-defined properties that allow for automated concurrency and distributed execution. Further, the particula...
ICDT
2009
ACM
14 years 10 months ago
2009
ACM
Schema mappings are declarative specifications that describe the relationship between two database schemas. In recent years, there has been an extensive study of schema mappings a...