Structural measures for games and process control in the branch learning model
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1142314 (Why is no real title available?)
- scientific article; zbMATH DE number 2077147 (Why is no real title available?)
- scientific article; zbMATH DE number 795580 (Why is no real title available?)
- scientific article; zbMATH DE number 845926 (Why is no real title available?)
- Classical recursion theory. Vol. II
- Comparison of identification criteria for machine inductive inference
- Control of Infinite Behavior of Finite Automata
- Extremes in the degrees of inferability
- Inductive inference and unsolvability
- Infinite games played on finite graphs
- Language identification in the limit
- Learning to win process-control games watching game-masters
- On some games which are relevant to the theory of recursively enumerable sets
- On the structure of degrees of inferability.
- On the synthesis of discrete controllers for timed systems
- On the synthesis of strategies in infinite games
- Recursively presented games and strategies
- Solving Sequential Conditions by Finite-State Strategies
- Toward a mathematical theory of inductive inference
Cited in
(2)
This page was built for publication: Structural measures for games and process control in the branch learning model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1575709)
