scientific article; zbMATH DE number 3269042

zbMath0168.01305MaRDI QIDQ5553288

Peter H. Starke

Publication date: 1966

Full work available at URL: https://eudml.org/doc/28862

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

languages, automata, networks

Related Items

Zur Theorie abstrakter stochastischer Automaten ⋮ Equivalence in automata theory based on complete residuated lattice-valued logic ⋮ Tight bound on the length of distinguishing sequences for non-observable nondeterministic finite-state machines with a polynomial number of inputs and outputs ⋮ Probabilistic automata ⋮ Research in the theory of inductive inference by GDR mathematicians - A survey ⋮ Equivalence, reduction and minimization of finite fuzzy-automata ⋮ On Kleene algebras ⋮ A decomposition theorem for probabilistic transition systems ⋮ Synchronization ⋮ A note on two-way probabilistic automata ⋮ On Turing degrees of Walrasian models and a general impossibility result in the theory of decision-making ⋮ General control systems ⋮ Automata theory based on complete residuated lattice-valued logic: Pushdown automata ⋮ Automata theory based on complete residuated lattice-valued logic: a categorical approach ⋮ On effectively computable realizations of choice functions

Cites Work

• Finite abstract random automata
• Stochastische Ereignisse und Wortmengen
• Probabilistic automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item