Results 261 to 270 of about 43,033 (311)
Some of the next articles are maybe not open access.
An Introduction to the Theory of Formal Languages and Automata
1974The present text is a re-edition of Volume I of Formal Grammars in Linguistics and Psycholinguistics, a three-volume work published in 1974. This volume is an entirely self-contained introduction to the theory of formal grammars and automata, which hasn’t lost any of its relevance.
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
Using theoretical computer simulators for formal languages and automata theory
ACM SIGCSE Bulletin, 2003Both formal languages and automata theory (FLAT) are core to the CS curricula but are difficult to teach and to learn. This situation has motivated the development of a number of theoretical computer simulators as educational tools to allow students to "bring to life" many topics that traditionally were presented ...
María Laura Cobo +2 more
openaire +2 more sources
Semirings and Formal Power Series: Their Relevance to Formal Languages and Automata
1997The purpose of Chapter 9 is to develop some classical results on formal languages and automata by an algebraic treatment using semirings, formal power series and matrices. The use of semirings, formal power series and matrices makes the proofs computational in nature and, consequently, more satisfactory from the mathematical point of view than the ...
openaire +2 more sources
Incremental Learning of Cellular Automata for Parallel Recognition of Formal Languages
2010Parallel language recognition by cellular automata (CAs) is currently an important subject in computation theory. This paper describes incremental learning of one-dimensional, bounded, one-way, cellular automata (OCAs) that recognize formal languages from positive and negative sample strings.
Katsuhiko Nakamura, Keita Imada
openaire +2 more sources
SHIFT: A formalism and a programming language for dynamic networks of hybrid automata
1997SHIFT is a programming language for the specification and simulation of dynamic networks of hybrid automata. Such systems consist of components which can be created, interconnected and destroyed as the system evolves. Components exhibit hybrid behavior, consisting of continuous-time phases separated by discrete-event transitions.
Akash Deshpande +2 more
openaire +2 more sources
A SIMULATOR FOR TEACHING AUTOMATAS AND FORMAL LANGUAGES - FLyA
Proceedings of the 11th International Conference on Enterprise Information, 2009Héctor A. Montes Venegas +3 more
openaire +2 more sources
Formal Languages and their Relation to Automata
Nuclear Science and Engineering, 1970openaire +2 more sources
American Cancer Society Guideline for the Early Detection of Cervical Neoplasia and Cancer
Ca-A Cancer Journal for Clinicians, 2002Carolyn D Runowicz +2 more
exaly