The following pages link to (Q5553288):
Displayed 15 items.
- Tight bound on the length of distinguishing sequences for non-observable nondeterministic finite-state machines with a polynomial number of inputs and outputs (Q413312) (← links)
- A decomposition theorem for probabilistic transition systems (Q673117) (← links)
- General control systems (Q754649) (← links)
- Synchronization (Q948067) (← links)
- Automata theory based on complete residuated lattice-valued logic: Pushdown automata (Q1037929) (← links)
- Automata theory based on complete residuated lattice-valued logic: a categorical approach (Q1040923) (← links)
- On effectively computable realizations of choice functions (Q1072545) (← links)
- Probabilistic automata (Q1151262) (← links)
- Research in the theory of inductive inference by GDR mathematicians - A survey (Q1151889) (← links)
- Equivalence, reduction and minimization of finite fuzzy-automata (Q1160487) (← links)
- A note on two-way probabilistic automata (Q1195495) (← links)
- On Turing degrees of Walrasian models and a general impossibility result in the theory of decision-making (Q1196206) (← links)
- Equivalence in automata theory based on complete residuated lattice-valued logic (Q2372274) (← links)
- Zur Theorie abstrakter stochastischer Automaten (Q5549818) (← links)
- On Kleene algebras (Q5894726) (← links)