scientific article; zbMATH DE number 5595151
From MaRDI portal
Publication:3392273
Cited in
(only showing first 100 items - show all)- DETERMINISTIC BLOW-UPS OF MINIMAL NONDETERMINISTIC FINITE AUTOMATA OVER A FIXED ALPHABET
- Almost periodic sequences.
- Tile invariants: New horizons.
- Factorizing RSA keys, an improved analogue solution
- Modal and mixed specifications: key decision problems and their complexities
- On Khot’s unique games conjecture
- Control design for specifications on stochastic hybrid systems
- Iterative temporal motion planning for hybrid systems in partially unknown environments
- Book review of: S. Arora and B. Barak, Computational complexity: a modern approach.
- Computational bounds on polynomial differential equations
- Verifying time complexity of Turing machines
- Grothendieck-type inequalities in combinatorial optimization
- On the expressiveness of interaction
- Small fast universal Turing machines
- Magic numbers and ternary alphabet
- Scott sentences for certain groups
- Multiple pattern matching: a Markov chain approach
- On expressive power of regular realizability problems
- State complexity of some operations on binary regular languages
- A study of a generalization of a card problem
- Reverse complexity
- Computation with finite stochastic chemical reaction networks
- Finite state complexity
- Self-similar fractals: an algorithmic point of view
- Computability, noncomputability and undecidability of maximal intervals of IVPs
- A structural/temporal query language for business processes
- Limited-information control of hybrid systems via reachable set propagation
- State complexity of projected languages
- Boundedness of the domain of definition is undecidable for polynomial ODEs
- Efficiently identifying deterministic real-time automata from labeled data
- On the formalization of some results of context-free language theory
- Physical portrayal of computational complexity
- Deterministic blow-ups of minimal NFA's
- The efficiency of identifying timed automata and the power of clocks
- Exponential lower bounds for polytopes in combinatorial optimization
- The axiomatic power of Kolmogorov complexity
- Solving NP-complete problems in the tile assembly model
- A context-free and a 1-counter geodesic language for a Baumslag-Solitar group
- On a structural property in the state complexity of projected regular languages
- On the Complexity of Input/Output Logic
- Stabhyli -- a tool for automatic stability verification of non-linear hybrid systems
- Zélus: a synchronous language with ODEs
- A formalization of multi-tape Turing machines
- Light tail asymptotics in multidimensional reflecting processes for queueing networks
- On deciding stability of multiclass queueing networks under buffer priority scheduling policies
- Two-Way Automata versus Logarithmic Space
- Reversal of binary regular languages
- Quantitative automata-based controller synthesis for non-autonomous stochastic hybrid systems
- Deciding unique decodability of bigram counts via finite automata
- A study of heuristic guesses for adiabatic quantum computation
- Size Complexity of Two-Way Finite Automata
- Codeword stabilized quantum codes: algorithm and structure
- Gaussian quantum computation with oracle-decision problems
- On solving systems of diagonal polynomial equations over finite fields
- Parallel dynamical systems over graphs and related topics: a survey
- Expander graphs and their applications
- Some remarks on real numbers induced by first-order spectra
- Complexity in union-free regular languages
- STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION
- On the expressive power of behavioral profiles
- Computability and dynamical systems
- Quantum walks: a comprehensive review
- On the State Complexity of Complements, Stars, and Reversals of Regular Languages
- Efficient 3-SAT algorithms in the tile assembly model
- Non-computable Julia sets
- Star-complement-star on prefix-free languages
- On regular realizability problems for context-free languages
- Operations on Unambiguous Finite Automata
- A full computation-relevant topological dynamics classification of elementary cellular automata
- Checking interval properties of computations
- Distinguishing two probability ensembles with one sample from each ensemble
- The stability of the deterministic Skorokhod problem is undecidable
- Asymptotic granularity reduction and its application
- Solving systems of diagonal polynomial equations over finite fields
- A toolbox for simulation of hybrid systems in Matlab/Simulink. Hybrid Equations (HyEQ) Toolbox
- 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
- Admissibility of cut in LC with fixed point combinator
- On the fairness and complexity of generalized \(k\)-in-a-row games
- Multiprocessor schedulability of arbitrary-deadline sporadic tasks: complexity and antichain algorithm
- On constructing possibly one-way functions based on the non-decidability of the endomorphism problem in groups
- On the computation of natural observers in discrete-event systems
- Permutation reconstruction from differences
- Automata equipped with auxiliary data structures and regular realizability problems
- Average-energy games
- Fan type condition and characterization of Hamiltonian graphs
- Equivalence classes and conditional hardness in massively parallel computations
- Interval type-2 fuzzy automata and interval type-2 fuzzy grammar
- \(\mathcal P = \mathcal{NP}\)?
- On the decidability of infix inclusion problem
- On conditional decomposability
- General decidability results for asynchronous shared-memory programs: higher-order and beyond
- Vanishing of l2‐cohomology as a computational problem
- Reasoning about actions with loops via Hoare logic
- The complexity of weakly recognizing morphisms
- An extension of complex role inclusion axioms in the description logic \(\mathcal{SROIQ}\)
- Efficient enumeration of regular expressions for faster regular expression synthesis
- The combinatorics of evenly spaced binomial coefficients
- On the complexity of bounded time and precision reachability for piecewise affine systems
- Succinct representations for (non)deterministic finite automata
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)
