scientific article; zbMATH DE number 5595151
From MaRDI portal
Publication:3392273
Cited in
(only showing first 100 items - show all)- On \(\tau\)-adic representations of integers
- Boolean circuit programming: A new paradigm to design parallel algorithms
- Factorizing RSA keys, an improved analogue solution
- Computation with finite stochastic chemical reaction networks
- Computational bounds on polynomial differential equations
- Tile invariants: New horizons.
- Almost periodic sequences.
- \(\mathcal P = \mathcal{NP}\)?
- System theory for system identification.
- Interactive and probabilistic proof-checking
- Graph-theoretical characterization of invertible cellular automata
- Characterizing polynomial and exponential complexity classes in elementary lambda-calculus
- Reasoning about actions with loops via Hoare logic
- Scott sentences for certain groups
- Quantum walks: a comprehensive review
- State complexity of some operations on binary regular languages
- Minimal DFA for testing divisibility
- A note on tolerance graph recognition
- On conditional decomposability
- Light tail asymptotics in multidimensional reflecting processes for queueing networks
- A deterministic algorithm for testing the equivalence of read-once branching programs with small discrepancy
- Decision problems and projection languages for restricted variants of two-dimensional automata
- General decidability results for asynchronous shared-memory programs: higher-order and beyond
- Fitness landscape analysis of automated machine learning search spaces
- Incompleteness and the halting problem
- Detectability of labeled weighted automata over monoids
- Succinct representation for (non)deterministic finite automata
- Automata equipped with auxiliary data structures and regular realizability problems
- The application of hypergroups in symbolic executions and finite automata
- 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
- Efficient enumeration of regular expressions for faster regular expression synthesis
- Equivalence classes and conditional hardness in massively parallel computations
- Interval type-2 fuzzy automata and interval type-2 fuzzy grammar
- A modal view on resource-bounded propositional logics
- On the decidability of infix inclusion problem
- On detectability of labeled Petri nets and finite automata
- Succinct representations for (non)deterministic finite automata
- Multiprocessor schedulability of arbitrary-deadline sporadic tasks: complexity and antichain algorithm
- Self-similar fractals: an algorithmic point of view
- On expressive power of regular realizability problems
- Does the polynomial hierarchy collapse if onto functions are invertible?
- The instability of instability of centered distributions
- A fixed-parameter perspective on \#BIS
- Determinizing monitors for HML with recursion
- A formal model of semantic computing
- Polynomial kernels for vertex cover parameterized by small degree modulators
- Parallel dynamical systems over graphs and related topics: a survey
- The stability of the deterministic Skorokhod problem is undecidable
- On the boundary of regular languages
- Regular expressions for data words
- Parameterized complexity classes beyond para-NP
- On the complexity of determinizing monitors
- Nondeterministic complexity of operations on free and convex languages
- Average-energy games
- Parallelizing time with polynomial circuits
- Computability of the Julia set. Nonrecurrent critical orbits
- The axiomatic power of Kolmogorov complexity
- On the fairness and complexity of generalized \(k\)-in-a-row games
- A study of a generalization of a card problem
- Regular path queries under approximate semantics
- Small fast universal Turing machines
- Cone types and geodesic languages for lamplighter groups and Thompson's group \(F\).
- Games for complexity of second-order call-by-name programs
- The 2004 Benjamin Franklin medal in computer and cognitive science presented to Richard M. Karp
- Efficient 3-SAT algorithms in the tile assembly model
- On the complexity of bounded time and precision reachability for piecewise affine systems
- Fixed points in generalized parallel and sequential dynamical systems induced by a minterm or maxterm Boolean functions
- Machines that perform measurements
- Exponential lower bounds for polytopes in combinatorial optimization
- Regular Programming for Quantitative Properties of Data Streams
- Non-regular Maximal Prefix-Free Subsets of Regular Languages
- Operations on Unambiguous Finite Automata
- On the formalization of some results of context-free language theory
- Computational complexity in non-Turing models of computation: the what, the why and the how
- Self-verifying finite automata and descriptional complexity
- The Complexity of Languages Resulting from the Concatenation Operation
- Nondeterministic complexity of operations on closed and ideal languages
- Kuratowski algebras generated by prefix-free languages
- Reverse complexity
- An efficient protocol for oblivious DFA evaluation and applications
- Grothendieck-type inequalities in combinatorial optimization
- Computability and dynamical systems
- Complexity in union-free regular languages
- Sub-propositional fragments of the interval temporal logic of Allen's relations
- Polynomial functors constrained by regular expressions
- On Effective Convergence of Numerical Solutions for Differential Equations
- A full computation-relevant topological dynamics classification of elementary cellular automata
- Kleene closure and state complexity
- Remarks on the computational power of some restricted variants of P systems with active membranes
- Poly-time computability of the Feigenbaum Julia set
- Least-violating control strategy synthesis with safety rules
- Limited-information control of hybrid systems via reachable set propagation
- Resilient synchronization in robust networked multi-agent systems
- Learning nonlinear hybrid systems: from sparse optimization to support vector regression
- Mining requirements from closed-loop control models
- On the decidability of stability of hybrid systems
- Lyapunov analysis of rigid body systems with impacts and friction via sums-of-squares
- Hybrid control Lyapunov functions for the stabilization of 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)
