Sciweavers

71 search results - page 5 / 15
» A Robust Class of Context-Sensitive Languages
Sort
View
CONCUR
2010
Springer
13 years 8 months ago
Mean-Payoff Automaton Expressions
Abstract. Quantitative languages are an extension of boolean languages that assign to each word a real number. Mean-payoff automata are finite automata with numerical weights on tr...
Krishnendu Chatterjee, Laurent Doyen, Herbert Edel...
CICLING
2005
Springer
14 years 1 months ago
Putting Pieces Together: Combining FrameNet, VerbNet and WordNet for Robust Semantic Parsing
Abstract. This paper describes our work in integrating three different lexical resources: FrameNet, VerbNet, and WordNet, into a unified, richer knowledge-base, to the end of ena...
Lei Shi, Rada Mihalcea
CORR
2011
Springer
175views Education» more  CORR 2011»
13 years 2 months ago
Finitary languages
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...
Krishnendu Chatterjee, Nathanaël Fijalkow
PODS
2010
ACM
170views Database» more  PODS 2010»
14 years 16 days ago
Simplifying XML schema: single-type approximations of regular tree languages
XML Schema Definitions (XSDs) can be adequately abstracted by the single-type regular tree languages. It is wellknown, that these form a strict subclass of the robust class of re...
Wouter Gelade, Tomasz Idziaszek, Wim Martens, Fran...
SCP
1998
113views more  SCP 1998»
13 years 7 months ago
Linear-Time Hierarchies for a Functional Language Machine Model
In STOC 93, Jones sketched the existence of a hierarchy within problems decidable in linear time by a first-order functional language based on tree-structured data (F), as well a...
Eva Rose