Results 251 to 260 of about 43,033 (311)
Cellular automata and formal languages
11th Annual Symposium on Switching and Automata Theory (swat 1970), 1970 A set of equivalences is established among cellular automata, iterative acceptors, and linear-bounded automata. However, cellular automata are shown to be inherently faster than iterative acceptors. Many positive results are presented to indicate that the context-free languages can, perhaps, be accepted in time n and space n by cellular automata.
Alvy Ray Smith
openaire +3 more sources
On the representation of formal languages using automata on networks
10th Annual Symposium on Switching and Automata Theory (swat 1969), 1969 A 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.
George N. Raney, Gerald A. Fisher
openaire +3 more sources
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.
John Mylopoulos
openaire +3 more sources
Cellular Automata, Formal Languages and Developmental Systems
, 1973 Publisher Summary This chapter discusses cellular automata, formal language, and developmental system. The term, “cellular” refers to the subunits with which construction is carried out, and does not imply an analogy of these subunits with cells of living organisms. Cellular-automaton models have also been introduced with reference to the development
Aristid Lindenmayer
openaire +3 more sources
Increasing interaction and support in the formal languages and automata theory course
ACM SIGCSE Bulletin, 2007 The introduction of educational software such as JFLAP into the course Formal Languages and Automata (FLA) has created a learning environment with automatic feedback on theoretical topics. In this paper we show how we further increase the interaction in the FLA course with the expansion of additional theoretical topics in JFLAP, and how we have added ...
Jinghui Lim +2 more
openaire +3 more sources
Elementary Computability, Formal Languages and Automata
IEE Proceedings E Computers and Digital Techniques, 1982 P.W. Grant
openaire +4 more sources
Recognition of formal languages in one-dimensional iterative automata [PDF]
Cybernetics, 1979 G. S. Plesnevich
openaire +2 more sources
Formal Languages and Automata [PDF]
, 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
Some of the next articles are maybe not open access.
Related searches:
Related searches:
A mobile app for teaching formal languages and automata
Computer Applications in Engineering Education, 2018AbstractFormal Languages and Automata (FLA) address mathematical models able to specify and recognize languages, their properties and characteristics. Although solid knowledge of FLA is extremely important for a B.Sc. degree in Computer Science and similar fields, the algorithms and techniques covered in the course are complex and difficult to ...
Carlos H. Pereira, Ricardo Terra
openaire +2 more sources
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 ...
Rogério Eduardo Garcia +3 more
openaire +2 more sources