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
- Lower bounds for multiplayer noncooperative games of incomplete information
- Descriptional and computational complexity of finite automata -- a survey
- On the complexity of some two-person perfect-information games
- Bounded repairability of word languages
- The complexity of computing the number of strings of given length in context-free languages
- Domino-tiling games
- Backdoors to satisfaction
- The complexity of first-order and monadic second-order logic revisited
- Dynamic Observers for the Synthesis of Opaque Systems
- A self-adaptive multi-engine solver for quantified Boolean formulas
- The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems
- On the complexity of propositional knowledge base revision, updates, and counterfactuals
- On the computational complexity of assumption-based argumentation for default reasoning.
- The complexity of synchronous notions of information flow security
- A comparison of polynomial time reducibilities
- On classes of tractable unrestricted regular expressions
- Weighted Bisimulation in Linear Algebraic Form
- Extended RDF: computability and complexity issues
- Five Determinisation Algorithms
- Complexity of equations over sets of natural numbers
- Minimizing finite automata is computationally hard
- Succinctness of regular expressions with interleaving, intersection and counting
- Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity
- Kleene monads: handling iteration in a framework of generic effects
- Phutball is PSPACE-hard
- Compressing BMC encodings with QBF
- The big-O problem
- The complexity of logical theories
- A framework for modular ERDF ontologies
- Backdoor sets of quantified Boolean formulas
- More complicated questions about maxima and minima, and some closures of NP
- On the minimization of XML schemas and tree automata for unranked trees
- Deciding determinism of unary languages
- The complexity of combinatorial problems with succinct input representation
- Computational completeness of equations over sets of natural numbers
- Redundancy in logic. I: CNF propositional formulae
- On tape-bounded complexity classes and multihead finite automata
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- Separation of complexity classes in Koiran's weak model
- Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
- Nondeterministic tree width of regular languages
- Propositional dynamic logic of regular programs
- A note on the space complexity of some decision problems for finite automata
- Latticed Simulation Relations and Games
- Model checking temporal properties of reaction systems
- Conjunctive grammars over a unary alphabet: Undecidability and unbounded growth
- Synthesis of Non-Interferent Timed Systems
- Relativization of questions about log space computability
- Logic, semigroups and automata on words
- Complexity of Boolean algebras
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)
