Results 261 to 270 of about 4,399 (316)

An Introduction to the Theory of Formal Languages and Automata

1974
The 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.
W. Levelt
openaire   +3 more sources

Formal languages and automata theory

2017
Linköping University
openaire   +2 more sources

Elementary Computability, Formal Languages and Automata

IEE Proceedings E Computers and Digital Techniques, 1982
P. W. Grant
openaire   +2 more sources

Semirings and Formal Power Series: Their Relevance to Formal Languages and Automata

Handbook of Formal Languages, 1997
W. Kuich
openaire   +2 more sources

INTRODUCTION TO FORMAL LANGUAGES AND AUTOMATA

2002
Kou-Yuan Huang
openaire   +2 more sources

Formal Languages, Automata and Numeration Systems 1

2014
M. Rigo
openaire   +2 more sources

Teaching Formal Languages with Visualizations and Auto-Graded Exercises

Technical Symposium on Computer Science Education, 2021
The material taught in a Formal Languages and Automata (FLA) course is mathematical in nature and requires students to practice proofs and algorithms to understand the content. Traditional FLA textbooks are heavy on prose, and homework typically consists
Mostafa Mohammed, C. Shaffer, S. Rodger
semanticscholar   +1 more source

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.
openaire   +1 more source

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
openaire   +2 more sources

Formal Languages and Automata

2022
Laszlo Csirmaz, Zalán Gyenis
openaire   +1 more source