System identification via state characterization

DOI10.1016/0005-1098(72)90033-7zbMath0251.93008OpenAlexW1982536735MaRDI QIDQ2557198

E. Mark Gold

Publication date: 1972

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0005-1098(72)90033-7

Mathematics Subject Classification ID

Formal languages and automata (68Q45) System identification (93B30) Large-scale systems (93A15)

Related Items (6)

Identification of pattern languages from examples and queries ⋮ Learning regular sets from queries and counterexamples ⋮ Efficient learning of typical finite automata from random walks ⋮ Inference of regular languages using state merging algorithms with search ⋮ Inference of deterministic one-counter languages ⋮ A categorical framework for learning generalised tree automata

Cites Work

• On the relevance of abstract algebra to control theory
• System identification. A survey
• On the Length of the Smallest Uniform Experiment which Distinguishes the Terminal States of a Machine
• State-identification experiments in finite automata
• Controllability and Observability in Multivariable Control Systems
• Mathematical Description of Linear Dynamical Systems
• Least Upper Bounds on Minimal Terminal State Experiments for Two Classes of Sequential Machines
• Ho's algorithm, commutative diagrams, and the uniqueness of minimal linear systems
• Limiting recursion
• Language identification in the limit
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: System identification via state characterization