scientific article; zbMATH DE number 5595151

zbMATH Open1169.68300MaRDI QIDQ3392273FDOQ3392273

Publication date: 13 August 2009

Title of this publication is not available (Why is that?)

Nonnumerical algorithms (68W05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cited In (only showing first 100 items - show all)

Observer design for a class of piecewise affine hybrid systems
Tracking differentiable trajectories across polyhedra boundaries
The application of hypergroups in symbolic executions and finite automata
Ambiguity of unary symmetric difference NFAs
The complexity of quantum circuit mapping with fixed parameters
Liouville numbers and the computational complexity of changing bases
On the complexity of conversion between classic real number representations
General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond
\(\mathcal P = \mathcal{NP}\)?
Automated analysis of real-time scheduling using graph games
Efficient enumeration of regular expressions for faster regular expression synthesis
Tracing compressed curves in triangulated surfaces
Safe schedulability of bounded-rate multi-mode systems
Regular Programming for Quantitative Properties of Data Streams
Minimal DFA for testing divisibility
Agent-based modeling, mathematical formalism for
Fan type condition and characterization of Hamiltonian graphs
Average-energy games
Equivalence classes and conditional hardness in massively parallel computations
Reasoning about actions with loops via Hoare logic
On detectability of labeled Petri nets and finite automata
Quadratic word equations with length constraints, counter systems, and Presburger arithmetic with divisibility
Grammar-based compression and its use in symbolic music analysis
An extension of complex role inclusion axioms in the description logic \(\mathcal{SROIQ}\)
Polynomial kernels for vertex cover parameterized by small degree modulators
On the decidability of infix inclusion problem
The combinatorics of evenly spaced binomial coefficients
Square on ideal, closed and free languages
Complement on free and ideal languages
Title not available (Why is that?)
A modal view on resource-bounded propositional logics
Characterizing polynomial and exponential complexity classes in elementary lambda-calculus
Interval type-2 fuzzy automata and interval type-2 fuzzy grammar
Fractal structure on \(k\)-SAT
A Unified Method to Decentralized State Detection and Fault Diagnosis/prediction of Discrete-event Systems
Vanishing of l²‐cohomology as a computational problem
Succinct representations for (non)deterministic finite automata
Regular model checking revisited
Nondeterministic complexity of operations on free and convex languages
General decidability results for asynchronous shared-memory programs: higher-order and beyond
Incompleteness and the halting problem
Reachability analysis of nonlinear systems using conservative polynomialization and non-convex sets
Fitness landscape analysis of automated machine learning search spaces
Computability of the Julia set. Nonrecurrent critical orbits
Determinizing monitors for HML with recursion
Regular expressions for data words
Linear automata with translucent letters and linear context-free trace languages
On the complexity of determinizing monitors
Parameterized complexity classes beyond para-NP
Poly-time computability of the Feigenbaum Julia set
On conditional decomposability
The complexity of weakly recognizing morphisms
On the complexity of bounded time and precision reachability for piecewise affine systems
Sub-propositional fragments of the interval temporal logic of Allen's relations
Detectability of labeled weighted automata over monoids
HYPER-MINIMIZATION IN O(n²)
On the boundary of regular languages
ON UNIFORMLY RECURRENT MORPHIC SEQUENCES
Succinct representation for (non)deterministic finite automata
Graph-theoretical characterization of invertible cellular automata
Mining requirements from closed-loop control models
Automata equipped with auxiliary data structures and regular realizability problems
Remarks on the computational power of some restricted variants of P systems with active membranes
Games for complexity of second-order call-by-name programs
Synchronous Boolean finite dynamical systems on directed graphs over XOR functions
Learning nonlinear hybrid systems: from sparse optimization to support vector regression
Flowpipe approximation and clustering in space-time
On the computational power of affine automata
The Complexity of Languages Resulting from the Concatenation Operation
Decision problems and projection languages for restricted variants of two-dimensional automata
Synchronization problems in automata without non-trivial cycles
Interactive and probabilistic proof-checking
Lifting non-finite axiomatizability results to extensions of process algebras
Lyapunov analysis of rigid body systems with impacts and friction via sums-of-squares
Second-level algorithms, superrecursivity, and recovery problem in distributed systems
Statistical estimation with bounded memory
Control of discrete-event systems with partial observations using coalgebra and coinduction
Producing and verifying extremely large propositional refutations
The complexity of finding SUBSEQ\((A)\)
Frontiers of tractability for typechecking simple XML transformations
On the algorithmic complexity of static structures
A new mapping between combinatorial proofs and sequent calculus proofs read out from logical flow graphs
On binary circle plus operator \(\oplus\)-NFAs and succinct descriptions of regular languages
Fixed points in generalized parallel and sequential dynamical systems induced by a minterm or maxterm Boolean functions
A bypassing path based routing algorithm for the pyramid structures
System theory for system identification.
Randomness and computation
A fixed-parameter perspective on \#BIS
Inverse subsemigroups of finite index in finitely generated inverse semigroups
Magic Numbers and Ternary Alphabet
A consequence of a proof of the one-way function existence for the problem of macroscopic superpositions
Regular path queries under approximate semantics
Does the polynomial hierarchy collapse if onto functions are invertible?
A deterministic algorithm for testing the equivalence of read-once branching programs with small discrepancy
Computational complexity in non-Turing models of computation: the what, the why and the how
Self-verifying finite automata and descriptional complexity
Lower bounds for the graph homomorphism problem
Tradeoff lower lounds for stack machines
On the decidability of stability of hybrid systems
Boolean circuit programming: A new paradigm to design parallel algorithms

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 Q3392273)