Results 171 to 180 of about 45,230 (224)
, 1999 Some of the next articles are maybe not open access.
Related searches:
Related searches:
Cellular automata and formal languages
11th Annual Symposium on Switching and Automata Theory (swat 1970), 1970A 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.
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
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 +1 more source
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 ...
Gabriel Spadon de Souza +3 more
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
Cellular Automata, Formal Languages and Developmental Systems
1973Publisher 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
openaire +1 more source
Automata theory and formal language in artificial intelligence
Abstract: Automata theory and formal languages are fundamental components of the AI (artificial intelligence) and ML (machine learning) ecosystem. These references back to automata theory, which has implications in machine learning by providing a theoretical framework for designing algorithms that can learn from and manipulate large amounts of data ...null Kanika, Sunil Kumar
openaire +1 more source