Results 261 to 270 of about 2,538 (309)
Some of the next articles are maybe not open access.
Teaching-learning methodology for formal languages and automata theory
2015 IEEE Frontiers in Education Conference (FIE), 2015Formal languages and automata (FLA) theory have fundamental relevance to the base of knowledge in the computer science area, especially focusing on scientific education. Usually presented by a discipline, the teaching-learning process of FLA is characterized by the high level of abstraction, and it is considered difficult due to the complexity of ...
Celso Olivete, Rogerio Eduardo Garcia
exaly +2 more sources
Automata Theory and Formal Languages
Undergraduate Topics in Computer Science, 2022exaly +3 more sources
On the representation of formal languages using automata on networks
10th Annual Symposium on Switching and Automata Theory (swat 1969), 1969A new model of abstract automata is presented employing the concept of finite automata on a network. Each normal network n provided with a one-way input tape determines a family of languages nl. A representation theorem, analogous to the Chomsky-Schutzenberger representation theorem for context free languages1, is proved for the class nl.
Gerald A. Fischer, George N. Raney
openaire +1 more source
1985
Study of formal languages and automata theory is a prerequisite for much of the material covered in this text. In this chapter, I will give a survey which is adequate for our purposes. The literature in the field is, however, extensive and the interested reader can gain a much deeper understanding of the topics discussed in this survey by studying some
openaire +1 more source
Study of formal languages and automata theory is a prerequisite for much of the material covered in this text. In this chapter, I will give a survey which is adequate for our purposes. The literature in the field is, however, extensive and the interested reader can gain a much deeper understanding of the topics discussed in this survey by studying some
openaire +1 more source
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 +2 more sources
A course on the relationship of formal language theory to automata
ACM SIGCSE Bulletin, 1970This paper describes the second course in a graduate sequence in Computer Science given at the University of Tennessee, Knoxville. The purpose of this sequence is to provide students with a theoretical base in formal language theory for understanding and interpretation of concepts and relationships in programming and automata theory.
openaire +1 more source
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
A Second Course in Formal Languages and Automata Theory
2008Written for graduate students and advanced undergraduates in computer science, A Second Course in Formal Languages and Automata Theory treats topics in the theory of computation not usually covered in a first course. After a review of basic concepts, the book covers combinatorics on words, regular languages, context-free languages, parsing and ...
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