Deciding Equivalence of Separated Non-Nested Attribute Systems in Polynomial Time

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-030-17127-8_28
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer International Publishing

Related search

A Polynomial-Time Algorithm for Deciding Bisimulation Equivalence of Normed Basic Parallel Processes

Mathematical Structures in Computer Science
MathematicsComputer Science Applications
1996English

DEEPSEC: Deciding Equivalence Properties in Security Protocols Theory and Practice

2018English

On Projective Equivalence of Univariate Polynomial Subspaces

Symmetry, Integrability and Geometry: Methods and Applications (SIGMA)
GeometryMathematical PhysicsAnalysisTopology
2009English

On Semi-Equivalence of Generically-Finite Polynomial Mappings

Mathematische Zeitschrift
Mathematics
2015English

Finite-Time Stability and Controller Design of Continuous-Time Polynomial Fuzzy Systems

Abstract and Applied Analysis
Applied MathematicsAnalysis
2017English

Input-Output Equivalence Transformations for Discrete-Time Nonlinear Systems

IFAC Proceedings Volumes
2004English

Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Observer‐based Controller for Positive Polynomial Systems With Time Delay

Optimal Control Applications and Methods
ControlSystems EngineeringApplied MathematicsOptimizationSoftware
2019English

Nonuniform Polynomial Dichotomy for Noninvertible Linear Discrete-Time Systems in Banach Spaces

Journal of Control Science and Engineering
Electronic EngineeringSimulationComputer Science ApplicationsElectricalModeling
2015English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy