Results 261 to 270 of about 46,330 (328)
Some of the next articles are maybe not open access.
An Introduction to the Theory of Formal Languages and Automata
, 2008The 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’
W. Levelt
semanticscholar +2 more sources
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
openalex +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.
Gerald A. Fisher, George N. Raney
openalex +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
openalex +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
openalex +3 more sources
Recognition of formal languages in one-dimensional iterative automata [PDF]
Cybernetics, 1979 G. S. Plesnevich
openalex +2 more sources
Teaching Formal Languages with Visualizations and Auto-Graded Exercises
Technical Symposium on Computer Science Education, 2021The 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
A Second Course in Formal Languages and Automata Theory
, 2008Intended 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.
Jeffrey Shallit
semanticscholar +1 more source
Formal Languages, Automata and Numeration Systems 1: Introduction to Combinatorics on Words
, 2014Combinatorics on words deals with problems that can be stated in a non-commutative monoid, such as subword complexity of finite or infinite words, construction and properties of infinite words, unavoidable regularities or patterns.
M. Rigo
semanticscholar +1 more source
Compositions of nondeterministic automata(Semigroups, Formal Languages and Computer Systems) [PDF]
, 1996 Balázs Imreh
openalex +2 more sources