scientific article; zbMATH DE number 3269042

MaRDI QIDQ5553288zbMATH OpenFDO

Authors Peter H. Starke

Publication date 1966

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

zbMATH Keywords

languages, automata, networks

Cites work

• Finite abstract random automata
• scientific article; zbMATH DE number 3240396 (Why is no real title available?)
• scientific article; zbMATH DE number 3240397 (Why is no real title available?)
• scientific article; zbMATH DE number 3240398 (Why is no real title available?)
• scientific article; zbMATH DE number 3109895 (Why is no real title available?)
• Probabilistic automata
• Stochastische Ereignisse und Wortmengen

Cited in

(15)

• 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
• Probabilistic automata
• Research in the theory of inductive inference by GDR mathematicians - A survey
• Equivalence, reduction and minimization of finite fuzzy-automata
• A note on two-way probabilistic automata
• On Turing degrees of Walrasian models and a general impossibility result in the theory of decision-making
• 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
• Zur Theorie abstrakter stochastischer Automaten
• On Kleene algebras
• A decomposition theorem for probabilistic transition systems
• General control systems
• Synchronization

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5553288)