scientific article; zbMATH DE number 3560737
From MaRDI portal
Publication:4131648
Cited in
(only showing first 100 items - show all)- Isomorphism of regular trees and words
- Hardness of approximation for knapsack problems
- From decidability to undecidability by considering regular sets of instances
- A complexity analysis of bisimilarity for value-passing processes
- Well-abstracted transition systems: Application to FIFO automata.
- Implementing automata. Selected papers from the 2nd international workshop, WIA '97, Univ. of Western Ontario, London, Ontario, Canada, September 18--20, 1997
- Complexity results for prefix grammars
- Problems on finite automata and the exponential time hypothesis
- Expressive capacity of subregular expressions
- Expansive automata networks
- Verifying polymer reaction networks using bisimulation
- Multi-linear iterative \(K\)-\(\Sigma\)-semialgebras.
- Distributed graph problems through an automata-theoretic lens
- Problems on finite automata and the exponential time hypothesis
- Comparing the notions of opacity for discrete-event systems
- Computing observers from observation policies in discrete-event systems
- On Boolean combinations forming piecewise testable languages
- Spanning the spectrum from safety to liveness
- scientific article; zbMATH DE number 7228403 (Why is no real title available?)
- The robustness of LWPP and WPP, with an application to graph reconstruction
- The recognition complexity of decidable theories
- Functions definable by arithmetic circuits
- Checking equivalences between concurrent systems of finite agents (extended abstract)
- Ranking function synthesis for bit-vector relations
- Lower bound techniques for QBF expansion
- scientific article; zbMATH DE number 7350780 (Why is no real title available?)
- The robustness of LWPP and WPP, with an application to graph reconstruction
- Logics for unordered trees with data constraints
- A formal methods approach to predicting new features of the eukaryotic vesicle traffic system
- On quantified propositional logics and the exponential time hierarchy
- On the complexity of formulas in semantic programming
- scientific article; zbMATH DE number 7450037 (Why is no real title available?)
- Minimal NFA and biRFSA Languages
- Fast algorithms for revision of some special propositional knowledge bases
- Parameterized complexity of theory of mind reasoning in dynamic epistemic logic
- Descriptional complexity of regular languages
- Max-plus automata
- Distributed graph problems through an automata-theoretic Lens
- The complexity of PDL with interleaving
- Reset complexity of ideal languages over a binary alphabet
- Reasoning About Substructures and Games
- Learning residual alternating automata
- Preprocessing for DQBF
- Size, cost and capacity: a semantic technique for hard random QBFs
- Characterization and complexity results on jumping finite automata
- Quantifier alternation for infinite words
- An axiomatic semantics for \(\mathsf{ioco} \underline{\mathsf{s}}\) conformance relation
- Reinterpreting dependency schemes: soundness meets incompleteness in DQBF
- Bounding queries in the analytic polynomial-time hierarchy
- Stable-unstable semantics: Beyond NP with normal logic programs
- Topological network-control games
- Goodbye ioco
- Computational complexity of reversible reaction systems
- Context-free grammars with lookahead
- Emptiness problems for integer circuits
- Complexity of the multilevel critical node problem
- Using decomposition-parameters for QBF: mind the prefix!
- The expressiveness of looping terms in the semantic programming
- The big-O problem for labelled Markov chains and weighted automata
- On the complexity of robust multi-stage problems with discrete recourse
- Testing containment of object-oriented conjunctive queries is ∏2p-hard
- Turing machines for dummies. Why representations do matter
- Efficient enumeration of regular expressions for faster regular expression synthesis
- Davis and Putnam meet Henkin: solving DQBF with resolution
- Certified DQBF solving by definition extraction
- Generalising automaticity to modal properties of finite structures
- Expressive completeness for LTL with modulo counting and group quantifiers
- NP completeness conditions for verifying the consistency of several kinds of systems of linear Diophantine discongruences
- THE MODAL LOGIC OF STEPWISE REMOVAL
- Feferman-vaught decompositions for prefix classes of first order logic
- Solution complexity of local variants of sabotage game
- Quantified Boolean Solving for Achievement Games
- Interactive proofs and a Shamir-like result for real number computations
- Proving Valid Quantified Boolean Formulas in HOL Light
- On the difference set of two transductions
- Super-Solutions
- Depletable channels: dynamics, behaviour, and efficiency in network design
- Balance problems for integer circuits
- Short Presburger Arithmetic Is Hard
- OuterCount: a first-level solution-counter for quantified Boolean formulas
- Balance problems for integer circuits
- Efficiently representing existential dependency sets for expansion-based QBF solvers
- Incremental dead state detection in logarithmic time
- A logic for document spanners
- Solving projected model counting by utilizing treewidth and its limits
- Counting problems for Parikh images
- A Cookbook for Temporal Conceptual Data Modelling with Description Logics
- Validating QBF Validity in HOL4
- Limiting characterizations of low level space complexity classes
- On the restricted equivalence for subclasses of propositional logic
- One-Nonterminal Conjunctive Grammars over a Unary Alphabet
- A general language-based framework for specifying and verifying notions of opacity
- Beyond NP: quantifying over answer sets
- The (D)QBF preprocessor HQSpre -- underlying theory and its implementation
- Motivating explanations in Bayesian networks using MAP-independence
- Checking history-determinism is NP-hard for parity automata
- On the bounded theories of finite trees
- Towards logical foundations for probabilistic computation
- On Equations over Sets of Numbers and Their Limitations
- Block languages and their bitmap representations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4131648)
