SYSTEM IDENTIFICATION, APPROXIMATION AND COMPLEXITY
From MaRDI portal
Publication:4111346
DOI10.1080/03081077708934759zbMath0343.93016OpenAlexW2134547831MaRDI QIDQ4111346
Publication date: 1977
Published in: International Journal of General Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081077708934759
System identification (93B30) Estimation and detection in stochastic control theory (93E10) General systems (93A10)
Related Items
Induction of inference rules for expert systems, Where do we stand on measures of uncertainty, ambiguity, fuzziness, and the like?, The future of information, computer, and systems sciences, The Role of Uncertainty Principles in Inductive Systems Modelling, Reconstruction analysis-based algorithm to decompose a complex system into subsystems, DISCRETE AND CONTINUOUS MODELS, The distance between constituents, Sequential fuzzy system identification, Model discrimination using an algorithmic information criterion, PROBABILISTIC BEHAVIOUR/STRUCTURE TRANSFORMATIONS USING TRANSITIVE MOORE MODELS, NEW METHODS FOR THE IDENTIFICATION OF FINITE STATE SYSTEMS, EXPERIMENTS WITH SOME METHODS FOR THE IDENTIFICATION OF FINITE-STATE SYSTEMS, Abstract Models for Systems Identification, DECISION MAKING IN RECONSTRUCTABILITY ANALYSIS†, PROBABILISTIC FINITE STATE SYSTEM IDENTIFICATION
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The relation between information and variance analysis
- Foundations of system theory: Decomposable systems
- A category-theoretic approach to systems in a fuzzy world
- On the complexity of inexact computations
- An algorithm for the distance between two finite sequences
- The Lie algebra of visual perception
- Admissible probability measurement procedures
- Dynamical systems: Stability theory and applications
- A logical calculus of analogy involving functions of order 2
- Général dynamical processes. A mathematical introduction
- Locally testable languages
- On the inference of Turing machines from sample computations
- A Theory of Program Size Formally Identical to Information Theory
- Approximate language identification
- Concept representation in natural and artificial languages: Axioms, extensions and applications for fuzzy sets
- A new mechanism for a brain
- A fuzzy-algorithmic approach to the definition of complex or imprecise concepts
- A CONCEPTUAL BASIS FOR MODELLING AND SIMULATIONT†
- On the Complexity of Finite Sequences
- Behaviour/structure transformations under uncertainty
- The systems programming language, Malus
- The String-to-String Correction Problem
- Notion of dynamical input-output systems: causality and state concepts
- The Theory of Definite Automata
- Modal logic based on probability theory
- Logical basis for information theory and probability theory
- Foundations of pattern analysis
- Mathematical systems theory: Causality
- Learning with Finite Memory
- A theory of form
- A unified approach to the definition of random sequences
- Computational Complexity and Probability Constructions
- Matching Sequences under Deletion/Insertion Constraints
- Some decidability results on grammatical inference and complexity
- The definition of random sequences
- The use of grammatical inference for designing programming languages
- Concerning the constructive interpretation of auxiliary formulas. I
- Realization is universal
- A formal theory of inductive inference. Part I
- Language identification in the limit