Full Text Available
Access Full Text at Repository
Search Results - Information Science
-
Tree-Automatic Well-Founded Trees
Published in Logical Methods in Computer Science (2013)Subjects: “…Computer Science & Information Science…”
Get full text
Online Article RSS Article -
Bisimulations Meet PCTL Equivalences for Probabilistic Automata
Published in Logical Methods in Computer Science (2013)Subjects: “…Computer Science & Information Science…”
Get full text
-
Effective Characterizations of Simple Fragments of Temporal Logic Using Carton--Michel Automata
Published in Logical Methods in Computer Science (2013)Subjects: “…Computer Science & Information Science…”
Get full text
-
Time and Parallelizability Results for Parity Games with Bounded Tree and DAG Width
Published in Logical Methods in Computer Science (2013)Subjects: “…Computer Science & Information Science…”
Get full text
-
Total Representations
Published in Logical Methods in Computer Science (2013)Subjects: “…Computer Science & Information Science…”
Get full text
-
Two Variable vs. Linear Temporal Logic in Model Checking and Games
Published in Logical Methods in Computer Science (2013)Subjects: “…Computer Science & Information Science…”
Get full text
-
Infinite sequential Nash equilibrium
Published in Logical Methods in Computer Science (2013)Subjects: “…Computer Science & Information Science…”
Get full text
-
The degree structure of Weihrauch-reducibility
Published in Logical Methods in Computer Science (2013)Subjects: “…Computer Science & Information Science…”
Get full text
-
Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories
Published in Logical Methods in Computer Science (2013)Subjects: “…Computer Science & Information Science…”
Get full text
-
Polylogarithmic Cuts in Models of V^0
Published in Logical Methods in Computer Science (2013)Subjects: “…Computer Science & Information Science…”
Get full text
-
An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction
Published in Logical Methods in Computer Science (2013)Subjects: “…Computer Science & Information Science…”
Get full text
-
Call-by-Value and Call-by-Name Dual Calculi with Inductive and Coinductive Types
Published in Logical Methods in Computer Science (2013)Subjects: “…Computer Science & Information Science…”
Get full text
-
Unifying Büchi Complementation Constructions
Published in Logical Methods in Computer Science (2013)Subjects: “…Computer Science & Information Science…”
Get full text
-
Collapsible Pushdown Graphs of Level 2 are Tree-Automatic
Published in Logical Methods in Computer Science (2013)Subjects: “…Computer Science & Information Science…”
Get full text
-
L-Recursion and a new Logic for Logarithmic Space
Published in Logical Methods in Computer Science (2013)Subjects: “…Computer Science & Information Science…”
Get full text
-
Bisimilarity on Basic Process Algebra is in 2-ExpTime (an explicit proof)
Published in Logical Methods in Computer Science (2013)Subjects: “…Computer Science & Information Science…”
Get full text
-
On the Complexity of Equivalence and Minimisation for Q-weighted Automata
Published in Logical Methods in Computer Science (2013)Subjects: “…Computer Science & Information Science…”
Get full text
-
Generalizing determinization from automata to coalgebras
Published in Logical Methods in Computer Science (2013)Subjects: “…Computer Science & Information Science…”
Get full text
-
On (Subgame Perfect) Secure Equilibrium in Quantitative Reachability Games
Published in Logical Methods in Computer Science (2013)Subjects: “…Computer Science & Information Science…”
Get full text
-
Coarse abstractions make Zeno behaviours difficult to detect
Published in Logical Methods in Computer Science (2013)Subjects: “…Computer Science & Information Science…”
Get full text