Learning closed signal flow graphs
From MaRDI portal
Cites work
- (Co)algebraic characterizations of signal flow graphs
- A categorical semantics of signal flow graphs
- A tutorial on coinductive stream calculus and signal flow graphs
- Applications of weighted automata in natural language processing
- Behavioural differential equations: a coinductive calculus of streams, automata, and power series
- Categories in control
- Complexity of automaton identification from given data
- Elements of stream calculus (an extensive exercise in coinduction)
- Grammatical inference. Learning automata and grammars.
- scientific article; zbMATH DE number 41838 (Why is no real title available?)
- scientific article; zbMATH DE number 46532 (Why is no real title available?)
- scientific article; zbMATH DE number 1418458 (Why is no real title available?)
- Introduction to applied linear algebra. Vectors, matrices, and least squares
- Learning Behaviors of Automata from Multiplicity and Equivalence Queries
- Learning Deterministically Recognizable Tree Series — Revisited
- Learning functions represented as multiplicity automata
- Learning Multiplicity Tree Automata
- Learning Rational Stochastic Tree Languages
- Learning regular sets from queries and counterexamples
- Model checking linear-time properties of probabilistic systems
- Nonlinear control systems: An introduction
- On the definition of a family of automata
- Rational streams coalgebraically
- The calculus of signal flow diagrams. I: Linear relations on streams.
This page was built for publication: Learning closed signal flow graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6979830)
