scientific article; zbMATH DE number 5595151
From MaRDI portal
Publication:3392273
Cited in
(only showing first 100 items - show all)- 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
- Succinct representation for (non)deterministic finite automata
- Observer design for a class of piecewise affine hybrid systems
- Tracking differentiable trajectories across polyhedra boundaries
- Incompleteness and the halting problem
- Sub-propositional fragments of the interval temporal logic of Allen's relations
- Computability of the Julia set. Nonrecurrent critical orbits
- Graph-theoretical characterization of invertible cellular automata
- Fitness landscape analysis of automated machine learning search spaces
- Determinizing monitors for HML with recursion
- Detectability of labeled weighted automata over monoids
- Mining requirements from closed-loop control models
- On detectability of labeled Petri nets and finite automata
- Fractal structure on \(k\)-SAT
- Safe schedulability of bounded-rate multi-mode systems
- Tracing compressed curves in triangulated surfaces
- Agent-based modeling, mathematical formalism for
- Remarks on the computational power of some restricted variants of P systems with active membranes
- On the boundary of regular languages
- Nondeterministic complexity of operations on free and convex languages
- A Unified Method to Decentralized State Detection and Fault Diagnosis/prediction of Discrete-event Systems
- Polynomial kernels for vertex cover parameterized by small degree modulators
- Reachability analysis of nonlinear systems using conservative polynomialization and non-convex sets
- scientific article; zbMATH DE number 7676615 (Why is no real title available?)
- Quadratic word equations with length constraints, counter systems, and Presburger arithmetic with divisibility
- Poly-time computability of the Feigenbaum Julia set
- The complexity of quantum circuit mapping with fixed parameters
- ON UNIFORMLY RECURRENT MORPHIC SEQUENCES
- Liouville numbers and the computational complexity of changing bases
- On the complexity of conversion between classic real number representations
- Linear automata with translucent letters and linear context-free trace languages
- Regular expressions for data words
- Automated analysis of real-time scheduling using graph games
- Games for complexity of second-order call-by-name programs
- The application of hypergroups in symbolic executions and finite automata
- Grammar-based compression and its use in symbolic music analysis
- On the complexity of determinizing monitors
- Synchronous Boolean finite dynamical systems on directed graphs over XOR functions
- A modal view on resource-bounded propositional logics
- General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond
- Characterizing polynomial and exponential complexity classes in elementary lambda-calculus
- Learning nonlinear hybrid systems: from sparse optimization to support vector regression
- Regular Programming for Quantitative Properties of Data Streams
- Minimal DFA for testing divisibility
- Ambiguity of unary symmetric difference NFAs
- Square on ideal, closed and free languages
- Complement on free and ideal languages
- Parameterized complexity classes beyond para-NP
- HYPER-MINIMIZATION IN O(n2)
- 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
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)
