The following pages link to (Q4131648):
Displaying 50 items.
- Expansive automata networks (Q2003992) (← links)
- Verifying polymer reaction networks using bisimulation (Q2003997) (← links)
- Complexity of universality and related problems for partially ordered NFAs (Q2013561) (← links)
- A formal methods approach to predicting new features of the eukaryotic vesicle traffic system (Q2022307) (← links)
- The robustness of LWPP and WPP, with an application to graph reconstruction (Q2027204) (← links)
- From decidability to undecidability by considering regular sets of instances (Q2062120) (← links)
- Comparing the notions of opacity for discrete-event systems (Q2063098) (← links)
- On verification of D-detectability for discrete event systems (Q2065231) (← links)
- Max-plus automata (Q2074207) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- Learning residual alternating automata (Q2105462) (← links)
- Efficient enumeration of regular expressions for faster regular expression synthesis (Q2117664) (← links)
- Distributed graph problems through an automata-theoretic Lens (Q2117706) (← links)
- Davis and Putnam meet Henkin: solving DQBF with resolution (Q2118283) (← links)
- Certified DQBF solving by definition extraction (Q2118343) (← links)
- Complexity of the multilevel critical node problem (Q2121476) (← links)
- Emptiness problems for integer circuits (Q2182324) (← links)
- Context-free grammars with lookahead (Q2232284) (← links)
- Ranking function synthesis for bit-vector relations (Q2248069) (← links)
- Computational completeness of equations over sets of natural numbers (Q2252522) (← links)
- Conjunctive grammars over a unary alphabet: Undecidability and unbounded growth (Q2268341) (← links)
- Equivalence problems for circuits over sets of natural numbers (Q2268343) (← links)
- Using decomposition-parameters for QBF: mind the prefix! (Q2304627) (← links)
- The expressiveness of looping terms in the semantic programming (Q2306056) (← links)
- On coarser interval temporal logics (Q2321249) (← links)
- A logic for document spanners (Q2322723) (← links)
- Interactive proofs and a Shamir-like result for real number computations (Q2323360) (← links)
- Reinterpreting dependency schemes: soundness meets incompleteness in DQBF (Q2323446) (← links)
- Balance problems for integer circuits (Q2333814) (← links)
- Hardness of approximation for knapsack problems (Q2345987) (← links)
- Characterization and complexity results on jumping finite automata (Q2357104) (← links)
- On Boolean combinations forming piecewise testable languages (Q2358689) (← links)
- Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete (Q2367539) (← links)
- Generalising automaticity to modal properties of finite structures (Q2373714) (← links)
- NP completeness conditions for verifying the consistency of several kinds of systems of linear Diophantine discongruences (Q2404747) (← links)
- Initial-state detectability of stochastic discrete-event systems with probabilistic sensor failures (Q2407177) (← links)
- Depletable channels: dynamics, behaviour, and efficiency in network design (Q2422775) (← links)
- Logics for unordered trees with data constraints (Q2424682) (← links)
- FLP answer set semantics without circular justifications for general logic programs (Q2453743) (← links)
- Redundancy in logic. I: CNF propositional formulae (Q2457681) (← links)
- Mean-payoff games with partial observation (Q2636514) (← links)
- The complexity of online manipulation of sequential elections (Q2637642) (← links)
- Minimizing nfa's and regular expressions (Q2641868) (← links)
- A general language-based framework for specifying and verifying notions of opacity (Q2673762) (← links)
- Motivating explanations in Bayesian networks using MAP-independence (Q2677844) (← links)
- Solving projected model counting by utilizing treewidth and its limits (Q2680775) (← links)
- Distributed graph problems through an automata-theoretic lens (Q2689441) (← links)
- Quantifier Alternation for Infinite Words (Q2811342) (← links)
- Expressive Completeness for LTL With Modulo Counting and Group Quantifiers (Q2825418) (← links)
- Complexity Hierarchies beyond Elementary (Q2828216) (← links)
