3552 search results - page 339 / 711 » Proof theory in the abstract |
146
click to vote
LATA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Glushkov’s algorithm builds an ε-free nondeterministic automaton from a given regular expression. In the worst case, its number of states is linear and its number of t...
144
click to vote
STACS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. This paper solves the unambiguity and the sequentiality problem for polynomially ambiguous min-plus automata. This result is proved through a decidable algebraic characte...
188
click to vote
CALCO
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Parameterised monads have the same relationship to adjunctions with parameters as monads do to adjunctions. In this paper, we investigate algebras for parameterised monad...
173
Voted
CCA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We prove the correctness of a formalised realisability interpretation of extensions of first-order theories by inductive and coinductive definitions in an untyped λ-ca...
189
click to vote
ERSHOV
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Data privacy is an important application of ontology modularization. The aim is to publish one module while keeping the information of another module private. We show how...