Pages that link to "Item:Q2921996"
From MaRDI portal
The following pages link to Mathematical Foundations of Computer Science 2014 (Q2921996):
Displayed 50 items.
- Partial-Observation Stochastic Reachability and Parity Games (Q2921997) (← links)
- Random Deterministic Automata (Q2921998) (← links)
- Communication Complexity Theory: Thirty-Five Years of Set Disjointness (Q2921999) (← links)
- What Does the Local Structure of a Planar Graph Tell Us About Its Global Structure? (Q2922000) (← links)
- Choiceless Polynomial Time on Structures with Small Abelian Colour Classes (Q2922002) (← links)
- Sofic-Dyck Shifts (Q2922003) (← links)
- A Logical Characterization of Timed (non-)Regular Languages (Q2922004) (← links)
- Asymptotic Monadic Second-Order Logic (Q2922005) (← links)
- Towards Efficient Reasoning Under Guarded-Based Disjunctive Existential Rules (Q2922006) (← links)
- Alternating Parity Krivine Automata (Q2922007) (← links)
- Advances in Parametric Real-Time Reasoning (Q2922008) (← links)
- Universal Lyndon Words (Q2922009) (← links)
- Subword Complexity and Decomposition of the Set of Factors (Q2922010) (← links)
- Cyclic Complexity of Words (Q2922011) (← links)
- Classifying Recognizable Infinitary Trace Languages Using Word Automata (Q2922012) (← links)
- Bounded Variable Logic, Parameterized Logarithmic Space, and Savitch’s Theorem (Q2922013) (← links)
- An Algebraic Characterization of Unary Two-Way Transducers (Q2922014) (← links)
- Size-Change Abstraction and Max-Plus Automata (Q2922015) (← links)
- Alternating Vector Addition Systems with States (Q2922017) (← links)
- Information Rate of Some Classes of Non-regular Languages: An Automata-Theoretic Approach (Q2922018) (← links)
- Relating Nominal and Higher-Order Rewriting (Q2922019) (← links)
- Expressivity and Succinctness of Order-Invariant Logics on Depth-Bounded Structures (Q2922020) (← links)
- Two Recursively Inseparable Problems for Probabilistic Automata (Q2922022) (← links)
- Monadic Second-Order Logic with Arbitrary Monadic Predicates (Q2922023) (← links)
- Transforming Two-Way Alternating Finite Automata to One-Way Nondeterministic Automata (Q2922024) (← links)
- Measure Properties of Game Tree Languages (Q2922025) (← links)
- On Upper and Lower Bounds on the Length of Alternating Towers (Q2922026) (← links)
- L ax F: Side Conditions and External Evidence as Monads (Q2922027) (← links)
- The Monoid of Queue Actions (Q2922028) (← links)
- Undecidable Properties of Self-affine Sets and Multi-tape Automata (Q2922029) (← links)
- Complexity and Expressivity of Uniform One-Dimensional Fragment with Equality (Q2922030) (← links)
- A Unifying Approach for Multistack Pushdown Automata (Q2922031) (← links)
- Definability and Transformations for Cost Logics and Automatic Structures (Q2922032) (← links)
- Generalised Lyndon-Schützenberger Equations (Q2922033) (← links)
- Complexity of Equivalence and Learning for Multiplicity Tree Automata (Q2922034) (← links)
- Monadic Datalog and Regular Tree Pattern Queries (Q2922036) (← links)
- Model Checking Concurrent Recursive Programs Using Temporal Logics (Q2922037) (← links)
- Decidability of the Interval Temporal Logic $\mathsf{A\bar{A}B\bar{B}}$ over the Rationals (Q2922038) (← links)
- Reachability in Pushdown Register Automata (Q2922039) (← links)
- A Generalization of the Łoś-Tarski Preservation Theorem over Classes of Finite Structures (Q2922040) (← links)
- Determinising Parity Automata (Q2922042) (← links)
- Tight Bounds for Complementing Parity Automata (Q2922043) (← links)
- On Infinite Words Determined by Indexed Languages (Q2922044) (← links)
- A Pumping Lemma for Two-Way Finite Transducers (Q2922045) (← links)
- Tractability Frontier for Dually-Closed Ord-Horn Quantified Constraint Satisfaction Problems (Q2922046) (← links)
- The Dynamic Descriptive Complexity of k-Clique (Q2922047) (← links)
- On r-Simple k-Path (Q2922590) (← links)
- Low-Depth Uniform Threshold Circuits and the Bit-Complexity of Straight Line Programs (Q2922591) (← links)
- Zero Knowledge and Circuit Minimization (Q2922592) (← links)
- A Tight Lower Bound on Certificate Complexity in Terms of Block Sensitivity and Sensitivity (Q2922593) (← links)