scientific article; zbMATH DE number 3560737
From MaRDI portal
Publication:4131648
Cited in
(only showing first 100 items - show all)- 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
- A guide to completeness and complexity for modal logics of knowledge and belief
- FLP answer set semantics without circular justifications for general logic programs
- On self-reducibility and weak P-selectivity
- On the computational cost of disjunctive logic programming: Propositional case
- Fair simulation
- Parity, circuits, and the polynomial-time hierarchy
- The complexity of the word problems for commutative semigroups and polynomial ideals
- Complete problems for deterministic polynomial time
- The polynomial-time hierarchy
- Semantics and complexity of recursive aggregates in answer set programming
- Succinctness of pattern-based schema languages for XML
- Simplifying XML schema: single-type approximations of regular tree languages
- The tractability frontier for NFA minimization
- The complexity of pursuit on a graph
- On the equivalence, containment, and covering problems for the regular and context-free languages
- One-nonterminal conjunctive grammars over a unary alphabet
- Complexity of equivalence problems for concurrent systems of finite agents
- Deciding whether a regular language is generated by a splicing system
- Synchronous Kleene algebra
- On the decidability and complexity of problems for restricted hierarchical hybrid systems
- Complete sets and the polynomial-time hierarchy
- Synthesis of opaque systems with static and dynamic masks
- CCS expressions, finite state processes, and three problems of equivalence
- On the complexity of Boolean unification
- Parsing Boolean grammars over a one-letter alphabet using online convolution
- Equations over sets of integers with addition only
- An extension-based approach to belief revision in abstract argumentation
- Inclusion Test Algorithms for One-Unambiguous Regular Expressions
- The complexity of two-player games of incomplete information
- Complexity of some problems in Petri nets
- Automatic Proof Generation in Kleene Algebra
- New complexity results about Nash equilibria
- Algorithms for Kleene algebra with converse
- Nominal Kleene coalgebra
- The complexity of membership problems for circuits over sets of integers
- Hex ist Pspace-vollständig. (Hex is Pspace-complete)
- Complexity hierarchies beyond elementary
- The emptiness problem for intersections of regular languages
- Minimizing nfa's and regular expressions
- 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
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)
