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)

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
Iterative temporal motion planning for hybrid systems in partially unknown environments
On a structural property in the state complexity of projected regular languages
A formalization of multi-tape Turing machines
Some remarks on real numbers induced by first-order spectra
Quantum walks: a comprehensive review
Grothendieck-type inequalities in combinatorial optimization
Boundedness of the domain of definition is undecidable for polynomial ODEs
On the Complexity of Input/Output Logic
On the expressive power of behavioral profiles
Operations on Unambiguous Finite Automata
On the computation of natural observers in discrete-event systems
Self-similar fractals: an algorithmic point of view
Formula-free finite abstractions for linear temporal verification of stochastic hybrid systems
Specification-guided controller synthesis for linear systems and safe linear-time temporal logic
Permutation reconstruction from differences
Book review of: S. Arora and B. Barak, Computational complexity: a modern approach.
On regular realizability problems for context-free languages
Checking interval properties of computations
A toolbox for simulation of hybrid systems in Matlab/Simulink. Hybrid Equations (HyEQ) Toolbox
A study of a generalization of a card problem
Parallel dynamical systems over graphs and related topics: a survey
The stability of the deterministic Skorokhod problem is undecidable
Almost periodic sequences.
Codeword stabilized quantum codes: algorithm and structure
Multiprocessor schedulability of arbitrary-deadline sporadic tasks: complexity and antichain algorithm
Magic numbers and ternary alphabet
State complexity of projected languages
Non-computable Julia sets
Star-complement-star on prefix-free languages
Tile invariants: New horizons.
On deciding stability of multiclass queueing networks under buffer priority scheduling policies
Asymptotic granularity reduction and its application
Verifying time complexity of Turing machines
Expander graphs and their applications
Computability and dynamical systems
On the State Complexity of Complements, Stars, and Reversals of Regular Languages
Computability, noncomputability and undecidability of maximal intervals of IVPs
The axiomatic power of Kolmogorov complexity
Distinguishing two probability ensembles with one sample from each ensemble
Deterministic blow-ups of minimal NFA's
Size Complexity of Two-Way Finite Automata
Solving systems of diagonal polynomial equations over finite fields
On the fairness and complexity of generalized \(k\)-in-a-row games
Light tail asymptotics in multidimensional reflecting processes for queueing networks
Complexity in union-free regular languages
On expressive power of regular realizability problems
Stabhyli -- a tool for automatic stability verification of non-linear hybrid systems
Zélus: a synchronous language with ODEs
Deciding unique decodability of bigram counts via finite automata
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

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)