Comparative analysis of automata with a common input alphabet

DOI10.1007/BF01069056MaRDI QIDQ3910004zbMATH OpenOpenAlexFDO

Authors R. N. Trofimchuk

Publication date 1980

Published in Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01069056

zbMATH Keywords

autonomous automatabehaviordegree of equivalencefinite automatanearness of the automaton mappingsstochastic automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• Boolean Matrices and the Stability of Neural Nets
• Finite Continuous Time Markov Chains
• scientific article; zbMATH DE number 3592980 (Why is no real title available?)
• scientific article; zbMATH DE number 3254909 (Why is no real title available?)
• scientific article; zbMATH DE number 3296351 (Why is no real title available?)
• scientific article; zbMATH DE number 3365149 (Why is no real title available?)
• scientific article; zbMATH DE number 3365976 (Why is no real title available?)
• scientific article; zbMATH DE number 3079573 (Why is no real title available?)
• THE ABSTRACT THEORY OF AUTOMATA
• The topology of the brain and visual perception

This page was built for publication: Comparative analysis of automata with a common input alphabet

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