Full Text Available
Access Full Text at Repository
Search Results - Computer Engineering
-
Well Behaved Transition Systems
Published in Logical Methods in Computer Science (2017)Subjects: “…Computer Science & Information Science…”
Get full text
Online Article RSS Article -
Edit Distance for Pushdown Automata
Published in Logical Methods in Computer Science (2017)Subjects: “…Computer Science & Information Science…”
Get full text
-
Localic completion of uniform spaces
Published in Logical Methods in Computer Science (2017)Subjects: “…Computer Science & Information Science…”
Get full text
-
Complexity theory for spaces of integrable functions
Published in Logical Methods in Computer Science (2017)Subjects: “…Computer Science & Information Science…”
Get full text
-
Fair Simulation for Nondeterministic and Probabilistic Buechi Automata: a Coalgebraic Perspective
Published in Logical Methods in Computer Science (2017)Subjects: “…Computer Science & Information Science…”
Get full text
-
Path Checking for MTL and TPTL over Data Words
Published in Logical Methods in Computer Science (2017)Subjects: “…Computer Science & Information Science…”
Get full text
-
On some categorical-algebraic conditions in S-protomodular categories
Published in Logical Methods in Computer Science (2017)Subjects: “…Computer Science & Information Science…”
Get full text
-
Hyper Normalisation and Conditioning for Discrete Probability Distributions
Published in Logical Methods in Computer Science (2017)Subjects: “…Computer Science & Information Science…”
Get full text
-
First Order Theories of Some Lattices of Open Sets
Published in Logical Methods in Computer Science (2017)Subjects: “…Computer Science & Information Science…”
Get full text
-
Retractability, games and orchestrators for session contracts
Published in Logical Methods in Computer Science (2017)Subjects: “…Computer Science & Information Science…”
Get full text
-
Some remarks on connectors and groupoids in Goursat categories
Published in Logical Methods in Computer Science (2017)Subjects: “…Computer Science & Information Science…”
Get full text
-
A revised completeness result for the simply typed $lambdamu$-calculus using realizability semantics
Published in Logical Methods in Computer Science (2017)Subjects: “…Computer Science & Information Science…”
Get full text
-
A Note on the Topologicity of Quantale-Valued Topological Spaces
Published in Logical Methods in Computer Science (2017)Subjects: “…Computer Science & Information Science…”
Get full text
-
On the Compositionality of Quantitative Information Flow
Published in Logical Methods in Computer Science (2017)Subjects: “…Computer Science & Information Science…”
Get full text
-
The Independence of Markov's Principle in Type Theory
Published in Logical Methods in Computer Science (2017)Subjects: “…Computer Science & Information Science…”
Get full text
-
The Algebraic Intersection Type Unification Problem
Published in Logical Methods in Computer Science (2017)Subjects: “…Computer Science & Information Science…”
Get full text
-
Complexity Hierarchies and Higher-order Cons-free Term Rewriting
Published in Logical Methods in Computer Science (2017)Subjects: “…Computer Science & Information Science…”
Get full text
-
Algebraic and logical descriptions of generalized trees
Published in Logical Methods in Computer Science (2017)Subjects: “…Computer Science & Information Science…”
Get full text
-
Focusing in Orthologic
Published in Logical Methods in Computer Science (2017)Subjects: “…Computer Science & Information Science…”
Get full text
-
Tracing where IoT data are collected and aggregated
Published in Logical Methods in Computer Science (2017)Subjects: “…Computer Science & Information Science…”
Get full text