Sciweavers

555 search results - page 50 / 111
» Complexity of Operations on Cofinite Languages
Sort
View
ACL
1998
13 years 9 months ago
Syntactic and Semantic Transfer with F-Structures
We present two approaches for syntactic and semantic transfer based on LFG f-structures and compare the results with existing co-description and restriction operator based approac...
Michael Dorna, Anette Frank, Josef van Genabith, M...
ICALP
2009
Springer
14 years 8 months ago
Limiting Negations in Formulas
Negation-limited circuits have been studied as a circuit model between general circuits and monotone circuits. In this paper, we consider limiting negations in formulas. The minimu...
Hiroki Morizumi
ENTCS
2007
101views more  ENTCS 2007»
13 years 7 months ago
A Framework for Timed Concurrent Constraint Programming with External Functions
The timed concurrent constraint programming language (tccp in short) was introduced for modeling reactive systems. This language allows one to model in a very intuitive way typica...
María Alpuente, Bernhard Gramlich, Alicia V...
OSDI
2008
ACM
14 years 8 months ago
SQCK: A Declarative File System Checker
The lowly state of the art for file system checking and repair does not match what is needed to keep important data available for users. Current file system checkers, such as e2fs...
Haryadi S. Gunawi, Abhishek Rajimwale, Andrea C. A...
ICALP
2010
Springer
14 years 13 days ago
Automata for Coalgebras: An Approach Using Predicate Liftings
Universal Coalgebra provides the notion of a coalgebra as the natural mathematical generalization of state-based evolving systems such as (infinite) words, trees, and transition s...
Gaëlle Fontaine, Raul Andres Leal, Yde Venema