Results 221 to 230 of about 942 (259)
Some of the next articles are maybe not open access.
Formal language recognition by stochastic cellular automata
Fundam. Informaticae, 2002Summary: We present two generalizations of Cellular Automata (CA) where transitions from one configuration to the next are no longer deterministic but depend on some element of randomization. The main topic is a model which not only takes into account the probabilities of cells being in certain states but also their dependencies.
Merkle, Daniel, Worsch, Thomas
openaire +2 more sources
On the application of formal language and automata theory to pattern recognition
Pattern Recognition, 1972Abstract This paper studies M-way automata as a method of defining patterns in a multidimensional discrete space. It is shown that the membership question is recursively solvable for large classes of automata while the emptiness question is r, unsolvable even for the class of M-way finite automata.
openaire +1 more source
Automata Theory and Formal Theory Languages
2022In this book we present some basic notions and results on Automata Theory, Formal Language Theory, Computability Theory, and Parsing Theory. In particular, we consider the class of regular languages which are related to the class of finite automata, and the class of the context-free languages which are related to the class of pushdown automata. For the
openaire +2 more sources
Didactic strategies for promoting significant learning in formal languages and automata theory
SIGCSE Bulletin, 2004Ana Maguitman
exaly +2 more sources
Formal Languages and their Relation to Automata
Nuclear Science and Engineering, 1970openaire +1 more source
A SIMULATOR FOR TEACHING AUTOMATAS AND FORMAL LANGUAGES - FLyA
Proceedings of the 11th International Conference on Enterprise Information, 2009José Raymundo Marcial-Romero +3 more
openaire +2 more sources
Exploring the topological entropy of formal languages
Theoretical Computer Science, 2021Florian Starke
exaly