Results 171 to 180 of about 670 (210)
Some of the next articles are maybe not open access.

On the application of formal language and automata theory to pattern recognition

Pattern Recognition, 1972
Abstract 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

Formal Languages and Automata

2022
Laszlo Csirmaz, Zalán Gyenis
openaire   +1 more source

Automata Theory and Formal Theory Languages

2022
In 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

A SIMULATOR FOR TEACHING AUTOMATAS AND FORMAL LANGUAGES - FLyA

Proceedings of the 11th International Conference on Enterprise Information, 2009
José Raymundo Marcial-Romero   +3 more
openaire   +1 more source

Exploring the topological entropy of formal languages

Theoretical Computer Science, 2021
Florian Starke
exaly  

Home - About - Disclaimer - Privacy