Access the full text.
Sign up today, get DeepDyve free for 14 days.
Noam Chomsky (1959)
On Certain Formal Properties of GrammarsInf. Control., 2
Noam Chomsky, M. Schützenberger (1963)
The Algebraic Theory of Context-Free Languages*Studies in logic and the foundations of mathematics, 35
M. Nivat (1968)
Transduction des langages de Chomsky
M. Arbib (1969)
Theories of abstract automata (Prentice-Hall series in automatic computation)
D. Cantor (1962)
On The Ambiguity Problem of Backus SystemsJ. ACM, 9
R. Parikh (1966)
On Context-Free LanguagesJ. ACM, 13
(1961)
Language generating devices Reprinted as " On context-free languages
(1951)
Structural linguistics (formerly entitled: Methods in structural linguistics)
(1957)
Finite automata and the representation of events ,
J. Carlyle, A. Paz (1971)
Realizations by Stochastic Finite AutomataJ. Comput. Syst. Sci., 5
(1956)
Representation of events in nerve sets Automata studies
W. B.
Aufgaben und Lehrsätze aus der Analysis.Nature, 116
(1970)
Inertie et rigidite des series rationnelles et algebriques
(1970)
Pure and applied algebra, Inaugural lecture
(1961)
On formal properties of simple phrase structure grammars, Z
M. Fliess (1970)
Deux applications de la representation matricielle d'une serie rationnelle non commutative
P. Cohn (1971)
The Embedding of Firs in Skew FieldsProceedings of The London Mathematical Society
(1959)
A note on phrase structure grammars, Information and Control Aspects of the theory of syntax
S. Kuroda (1964)
Classes of Languages and Linear-Bounded AutomataInf. Control., 7
(1958)
Computability and unsolvability, (McGraw-Hill
(1970)
Mathematical models in linguistics Introduction to formal grammars
S. Ginsburg, B. Partee (1969)
A Mathematical Model of Transformational GrammarsInf. Control., 15
P. Turakainen (1969)
Generalized automata and stochastic languages, 21
J. Conway (1971)
Regular algebra and finite machines
S. Ginsburg (1966)
The mathematical theory of context free languages
P. Cohn (1973)
Free rings and their relations
(1957)
Finite automata and the representation of events, Wright Air Development Command Tech
A. Nerode (1958)
Linear automaton transformations, 9
Series rationnelles et algebriques en variables non-commutatives, Cours du DEA 1969-70
(1899)
C. R. Acad. Sci. Paris
P. Peters, R. Ritchie (1971)
On Restricting the Base Component of Transformational GrammarsInf. Control., 18
M. Fliess (1975)
Séries rationnelles positives et processus stochastiquesAnnales De L Institut Henri Poincare-probabilites Et Statistiques, 11
J. Hartmanis, R. Stearns (1966)
Algebraic Structure Theory Of Sequential Machines
(1972)
Sur certaines families de series formelles
(1962)
On subsemigroups of free semigroups Factorization in non-commutative power series rings
Reinwald Jungen (1931)
Sur les séries de Taylor n'ayant que des singularités algébrico-logarithmiques sur leur cercle de convergenceCommentarii Mathematici Helvetici, 3
(1967)
Sur les Equivalences regulieres dans les demigroupes , C . R
(1970)
Transductions algebriques
(1961)
On formal properties of simple phrase structure grammars Reprinted in Handbook of Math
(1961)
A remark on finite transducers On the definition of a family of automata On a theorem of Jungen
(1958)
Finite state languages The algebraic theory of context-free languages, in " Computer programming and formal systems
(1951)
Sur les Equivalences regulieres dans les demi-groupes
A. Paz (1966)
Some aspects of Probabilistic AutomataInf. Control., 9
T. Booth (1967)
Sequential machines and automata theory
M. Gross (1972)
Mathematical models in linguistics
(1960)
Linear bounded automata, Wright Air Development Command Tech
On formal properties of simple phrase structure grammars , Z . Phonetik , Sprachwiss
P. Landweber (1963)
Three Theorems on Phrase Structure Grammars of Type 1Inf. Control., 6
E. Shamir (1967)
A Representation Theorem for Algebraic and Context-Free Power Series in Noncommuting VariablesInf. Control., 11
Noam Chomsky (1959)
A Note on Phrase Structure GrammarsInf. Control., 2
Bedford College, Regent's Park
(1970)
Series reconnaissables, rationnelles et algebriques Deux applications de la representation matricielle d'une serie rationelle non-commutative
(1970)
Mathematical models in linguistics, (Prentice-Hall, Englewood Cliffs, 1972). and Lentin, J., 70. Introduction to formal grammars, (Springer-Verlag
S. Eilenberg (1974)
Automata, languages, and machines. A
G. Pólya, G. Szegö, Dagmar Henney (1926)
Aufgaben und Lehrsätze aus der AnalysisThe Mathematical Gazette, 13
Matrices de Hankel, to appear
P. Cohn (1962)
On subsemigroups of free semigroups, 13
J. Hopcroft, J. Ullman (1969)
Formal languages and their relation to automata
(1968)
Language generating devices
M. Gross, A. Lentin (1970)
Introduction to Formal Grammars
(1967)
Sequential machines and automata theory, (J
Martin Davis (1959)
Computability and Unsolvability
M. Arbib (1969)
Theories of abstract automata
P. M. COHN 1. Introduction In the early days of high-speed computers there was a hope that it would be possible to program a computer to translate from one language to another, and this led to an intensive study of language structure. The result has been disappointing in that we are still far from making translations by computer, but that is no cause for despair. In the first place it shows that we have underestimated the richness and intricacy of our natural languages, even when used for quite prosaic ends. Secondly, this study of language has led to mathematical models of languages which admittedly are too simple to reflect all the complexities of a natural language like English, but —quite apart from their intrinsic interest—these models are found to give a good approximation to certain programming languages. And thirdly, there has been a vigorous interaction with some parts of noncommutative algebra, with benefit to " mathematical linguist " and algebraist alike. There is an extensive literature in the field, much of it written from the point of view of automata theory, but overlapping with orthodox linguistics, communication theory, probability, logic, and even algebra. Likewise there are several excellent expositions;
Bulletin of the London Mathematical Society – Wiley
Published: Mar 1, 1975
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.