Results 241 to 250 of about 3,411 (291)
Some of the next articles are maybe not open access.
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.
exaly +2 more sources
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 ...
Ricardo Terra
exaly +3 more sources
Automata Theory and Formal Languages
Undergraduate Topics in Computer Science, 2022exaly +3 more sources
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
Alberto Pettorossi
openaire +3 more sources
Automata Theory and Formal Languages (Third Edition)
, 2011 These lecture notes present some basic notions and results on Automata Theory, Formal Languages Theory, Computability Theory, and Parsing Theory. I prepared these notes for a course on Automata, Languages, and Translators which I am teaching at the University of Roma Tor Vergata.
PETTOROSSI, ALBERTO
core +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 +2 more sources
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