The notion of a probabilistic cellular acceptor

DOI10.1007/BF00977787zbMath0426.68076MaRDI QIDQ3862454

Immanuel I. Tung, H. P. Edmundson

Publication date: 1979

Published in: International Journal of Computer & Information Sciences (Search for Journal in Brave)

zbMATH Keywords

decision problemsprobabilistic cellular automatoncut pointlanguage acceptor

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Cellular automata (computational aspects) (68Q80)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Real-time language recognition by one-dimensional cellular automata
• On Some Open Problems in the Theory of Cellular Automata
• Some aspects of probabilistic automata
• Equivalences between probabilistic and deterministic sequential machines
• Probabilistic automata
• Generalized Automata and Stochastic Languages
• On stochastic languages
• A context-free language which is not acceptable by a probabilistic automaton
• Some closure properties of the family of stochastic languages
• Cellular automata complexity trade-offs
• Propriétés booléennes des langages stochastiques

This page was built for publication: The notion of a probabilistic cellular acceptor