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
Reversal of binary regular languages
STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION
DETERMINISTIC BLOW-UPS OF MINIMAL NONDETERMINISTIC FINITE AUTOMATA OVER A FIXED ALPHABET
Modal and mixed specifications: key decision problems and their complexities
Limited-information control of hybrid systems via reachable set propagation
Factorizing RSA keys, an improved analogue solution
Physical portrayal of computational complexity
Quantitative automata-based controller synthesis for non-autonomous stochastic hybrid systems
On the expressiveness of interaction
A study of heuristic guesses for adiabatic quantum computation
On solving systems of diagonal polynomial equations over finite fields
Multiple pattern matching: a Markov chain approach
Finite state complexity
A structural/temporal query language for business processes
Efficiently identifying deterministic real-time automata from labeled data
Solving NP-complete problems in the tile assembly model
Two-Way Automata versus Logarithmic Space
Admissibility of cut in LC with fixed point combinator
On Khot’s unique games conjecture
Exponential lower bounds for polytopes in combinatorial optimization
The efficiency of identifying timed automata and the power of clocks
On constructing possibly one-way functions based on the non-decidability of the endomorphism problem in groups
Computational bounds on polynomial differential equations
Small fast universal Turing machines
Reverse complexity
On the formalization of some results of context-free language theory
A context-free and a 1-counter geodesic language for a Baumslag-Solitar group
State complexity of some operations on binary regular languages
Computation with finite stochastic chemical reaction networks
Gaussian quantum computation with oracle-decision problems
Scott sentences for certain groups
Efficient 3-SAT algorithms in the tile assembly model
A full computation-relevant topological dynamics classification of elementary cellular automata
Control design for specifications on stochastic hybrid systems

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)