Automata and Languages

[1]  Peter S. Landweber,et al.  Three Theorems on Phrase Structure Grammars of Type 1 , 1963, Inf. Control..

[2]  J. C. Cleaveland,et al.  Grammars for programming languages , 1977 .

[3]  Janusz A. Brzozowski,et al.  OPEN PROBLEMS ABOUT REGULAR LANGUAGES , 1980 .

[4]  Walter J. Savitch,et al.  Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..

[5]  Ronald V. Book,et al.  Formal language theory : perspectives and open problems , 1980 .

[6]  James W. Thatcher,et al.  Characterizing Derivation Trees of Context-Free Grammars through a Generalization of Finite Automata Theory , 1967, J. Comput. Syst. Sci..

[7]  Grzegorz Rozenberg,et al.  Selective Substitution Grammars (Towards a Framework for Rewriting Systems). Part 1: Definitions and Examples , 1977, J. Inf. Process. Cybern..

[8]  Harlan D. Mills,et al.  Structured programming - theory and practice , 1979, The systems programming series.

[9]  Alfred V. Aho.  Indexed Grammars-An Extension of Context Free Grammars , 1967, SWAT.

[10]  Robert W. Floyd,et al.  The Syntax of Programming Languages-A Survey , 1964, IEEE Trans. Electron. Comput..

[11]  R. James Evey,et al.  Application of pushdown-store machines , 1899, AFIPS '63 (Fall).

[12]  G. Dantzig.  ON THE SIGNIFICANCE OF SOLVING LINEAR PROGRAMMING PROBLEMS WITH SOME INTEGER VARIABLES , 1960 .

[13]  Jeffrey D. Ullman,et al.  Protection in operating systems , 1976, CACM.

[14]  Jeffrey D. Ullman,et al.  The compilation of regular expressions into integrated circuits , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[15]  Ranan B. Banerji,et al.  Phrase Structure Languages, Finite Machines, and Channel Capacity , 1963, Inf. Control..

[16]  Y. BAR-HILLEL,et al.  On formai properties oî simple phreise structure grammars , 1961 .

[17]  Stephen A. Cook,et al.  Linear Time Simulation of Deterministic Two-Way Pushdown Automata , 1971, IFIP Congress.

[18]  Niklaus Wirth,et al.  Data structures and algorithms , 1984 .

[19]  Rohit Parikh,et al.  On Context-Free Languages , 1966, JACM.

[20]  Martin Davis,et al.  The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions , 2004 .

[21]  Bell Telephone,et al.  Regular Expression Search Algorithm , 1968 .

[22]  Juris Hartmanis,et al.  An Overview of the Theory of Computational Complexity , 1971, JACM.

[23]  Marvin Minsky,et al.  Computation : finite and infinite machines , 2016 .

[24]  Gregor von Bochmann,et al.  A Sampler of Formal Definitions , 1976, CSUR.

[25]  Mohamed G. Gouda,et al.  Priority Networks of Communicating Finite State Machines , 1985, SIAM J. Comput..

[26]  Reiko Heckel,et al.  Graph Grammars with Negative Application Conditions , 1996, Fundam. Informaticae.

[27]  John McCarthy,et al.  Correctness of a compiler for arithmetic expressions , 1966 .

[28]  Noam Chomsky,et al.  The Algebraic Theory of Context-Free Languages* , 1963 .

[29]  Martin D. Davis,et al.  Computability and Unsolvability , 1959, McGraw-Hill Series in Information Processing and Computers.

[30]  Jean Berstel,et al.  Transductions and context-free languages , 1979, Teubner Studienbücher : Informatik.

[31]  Alexander Meduna,et al.  On Semi-Conditional Grammars with Productions Having either Forbidding or Permitting Conditions , 1994, Acta Cybern..

[32]  Richard Edwin Stearns,et al.  Syntax-Directed Transduction , 1966, JACM.

[33]  Michael A. Arbib,et al.  The Design of Well-Structured and Correct Programs , 1978, Texts and Monographs in Computer Science.

[34]  Emil L. Post.  Recursive Unsolvability of a problem of Thue , 1947, Journal of Symbolic Logic.

[35]  Seymour Ginsburg,et al.  Studies In Abstract Families Of Languages , 1969 .

[36]  D. C. Cooper,et al.  Theory of Recursive Functions and Effective Computability , 1969, The Mathematical Gazette.

[37]  Marvin Minsky,et al.  Size and structure of universal Turing machines using Tag systems , 1962 .

[38]  Alfred V. Aho,et al.  The theory of parsing, translation, and compiling. 1: Parsing , 1972 .

[39]  Edward J. McCluskey,et al.  Signal Flow Graph Techniques for Sequential Circuit State Diagrams , 1963, IEEE Trans. Electron. Comput..

[40]  Lutz Priese,et al.  Towards a Precise Characterization of the Complexity of Universal and Nonuniversal Turing Machines , 1979, SIAM J. Comput..

[41]  Shigeru Watanabe,et al.  5-Symbol 8-State and 5-Symbol 6-State Universal Turing Machines , 1961, JACM.

[42]  H. Rice.  Classes of recursively enumerable sets and their decision problems , 1953 .

[43]  A. K. Chandra,et al.  Intrinsically Difficult Problems , 1979 .

[44]  Michael A. Harrison,et al.  Introduction to formal language theory , 1978 .

[45]  Daniel J. Rosenkrantz,et al.  Matrix Equations and Normal Forms for Context-Free Grammars , 1967, JACM.

[46]  Steven Vere.  Translation equations , 1970, CACM.

[47]  Janusz A. Brzozowski,et al.  A Survey of Regular Expressions and Their Applications , 1962, IRE Trans. Electron. Comput..

[48]  Gabor T. Herman.  A Biologically Motivated Extension of ALGOL-like Languages , 1973, Inf. Control..

[49]  Niklaus Wirth,et al.  Systematic Programming: An Introduction , 1974 .

[50]  Robert L. Berger.  The undecidability of the domino problem , 1966 .

[51]  W. Pitts,et al.  A Logical Calculus of the Ideas Immanent in Nervous Activity (1943) , 2021, Ideas That Created the Future.

[52]  Dana S. Scott,et al.  Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..

[53]  Jean-Jacques Pansiot.  A Note on Post's Correspondence Problem , 1981, Inf. Process. Lett..

[54]  John McCarthy,et al.  A basis for a mathematical theory of computation, preliminary report , 1899, IRE-AIEE-ACM '61 (Western).

[55]  Frank G. Pagan,et al.  Formal Specification of Programming Languages: A Panoramic Primer , 1981 .

[56]  Jean Berstel,et al.  Une suite decroissante de cônes rationnels , 1974, ICALP.

[57]  Alexander Meduna,et al.  A trivial method of characterizing the family of recursively enumerable languages by scattered context grammars , 1995, Bull. EATCS.

[58]  Edgar T. Irons,et al.  A syntax directed compiler for ALGOL 60 , 1961, CACM.

[59]  Alfred V. Aho,et al.  Pattern Matching in Strings , 1980 .

[60]  Thomas Ottmann,et al.  The Complexity of Manipulating Hierarchically Defined Sets of Rectangles , 1981, MFCS.

[61]  Seymour Ginsburg,et al.  Two Families of Languages Related to ALGOL , 1962, JACM.

[62]  Anthony G. Oettinger,et al.  Automatic syntactic analysis and the pushdown store , 1961 .

[63]  J. M. Foster,et al.  A syntax improving program , 1968, Comput. J..

[64]  Martin D. Davis.  Hilbert's Tenth Problem is Unsolvable , 1973 .

[65]  Emil L. Post.  Finite combinatory processes—formulation , 1936, Journal of Symbolic Logic.

[66]  Seymour Ginsburg,et al.  Operations Which Preserve Definability in Languages , 1963, JACM.

[67]  Nicos Christofides.  Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem , 1976, Operations Research Forum.

[68]  Ronald L. Graham,et al.  The Combinatorial Mathematics of Scheduling , 1978 .

[69]  A. Church.  An Unsolvable Problem of Elementary Number Theory , 1936 .

[70]  Elaine J. Weyuker,et al.  Computability, complexity, and languages - fundamentals of theoretical computer science , 2014, Computer science and applied mathematics.

[71]  Albert R. Meyer,et al.  The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space , 1972, SWAT.

[72]  Karl N. Levitt,et al.  Greatest Common Divisor of n Integers and Multipliers (Certification of Algorithm 386) , 1973, Commun. ACM.

[73]  Arto Salomaa,et al.  Computation and Automata , 1984 .

[74]  Daniel H. Younger,et al.  Recognition and Parsing of Context-Free Languages in Time n^3 , 1967, Inf. Control..

[75]  C. A. R. Hoare,et al.  An Axiomatic Definition of the Programming Language PASCAL , 1973, Acta Informatica.

[76]  Robert W. Floyd,et al.  On ambiguity in phrase structure languages , 1962, CACM.

[77]  Daniel Solow,et al.  How to Read and Do Proofs : An Introduction to mathematical Thought Processes/Daniel Solow , 1982 .

[78]  Robert McNaughton,et al.  Regular Expressions and State Graphs for Automata , 1960, IRE Trans. Electron. Comput..

[79]  J. C. Martin,et al.  Introduction to Languages and the Theory of Computation" 3rd Ed , 1991 .

[80]  Gheorghe Paun,et al.  Grammar Systems: A Grammatical Approach to Distribution and Cooperation , 1995, ICALP.

[81]  Gwendolyn B. Moore.  Accessing Individual Records from Personal Data Files Using Non-Unique Identifiers. Final Report. Computer Science & Technology Series. , 1977 .

[82]  J. W. de Bakker,et al.  Semantics of Programming Languages , 1969 .

[83]  Gheorghe Paun,et al.  Regulated Rewriting in Formal Language Theory , 1989 .

[84]  Robert B. Anderson.  proving programs correct , 1979 .

[85]  D. L. Pilling,et al.  Commutative Regular Equations and Parikh's Theorem , 1973 .

[86]  Alexander Meduna,et al.  On state grammars , 1988, Acta Cybern..

[87]  Yehoshua Bar-Hillel,et al.  The Intrinsic Computational Difficulty of Functions , 1969 .

[88]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

[89]  Arthur W. Burks,et al.  Essays on cellular automata , 1970 .

[90]  Alexander Meduna.  Global Context Conditional Grammars , 1991, J. Inf. Process. Cybern..

[91]  Donald E. Knuth,et al.  On the Translation of Languages from Left to Right , 1965, Inf. Control..

[92]  Leon J. Osterweil,et al.  Data Flow Analysis in Software Reliability , 1976, CSUR.

[93]  Melvin E. Conway,et al.  Design of a separable transition-diagram compiler , 1963, CACM.

[94]  Calvin C. Gotlieb,et al.  A List Structure Form of Grammars for Syntactic Analysis , 1970, CSUR.

[95]  Daniel J. Rosenkrantz,et al.  Properties of deterministic top down grammars , 1969, STOC.

[96]  A. Turing.  On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .

[97]  E. Lohse,et al.  A Correspondence Between ALGOL 60 and Church's Lambda- Notation: Part I* , 1965 .

[98]  Aristid Lindenmayer,et al.  Mathematical Models for Cellular Interactions in Development , 1968 .

[99]  Noam Chomsky,et al.  On Certain Formal Properties of Grammars , 1959, Inf. Control..

[100]  Tadao Kasami,et al.  An Efficient Recognition and Syntax-Analysis Algorithm for Context-Free Languages , 1965 .

[101]  Richard Edwin Stearns,et al.  Memory bounds for recognition of context-free and context-sensitive languages , 1965, SWCT.

[102]  Annegret Habel,et al.  Hyperedge Replacement: Grammars and Languages , 1992, Lecture Notes in Computer Science.

[103]  SIDNEY L. HANTLER,et al.  An Introduction to Proving the Correctness of Programs , 1976, CSUR.

[104]  Martin Gardner,et al.  Wheels, life, and other mathematical amusements , 1983 .

[105]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[106]  T. Rado.  On non-computable functions , 1962 .

[107]  Michael A. Arbib,et al.  Discrete Mathematics: Applied Algebra for Computer and Information Science , 1974 .

[108]  Sheila A. Greibach,et al.  The Undecidability of the Ambiguity Problem for Minimal Linear Grammars , 1963, Inf. Control..

[109]  William W. Wadge,et al.  Lucid - A Formal System for Writing and Proving Programs , 1976, SIAM J. Comput..

[110]  Derick Wood,et al.  Paradigms and programming with PASCAL , 1984 .

[111]  Mary Katherine Yntema,et al.  Cap Expressions for Context-Free Languages , 1971, Inf. Control..

[112]  John McCarthy,et al.  Recursive functions of symbolic expressions and their computation by machine, Part I , 1960, Commun. ACM.

[113]  John C. Shepherdson,et al.  Computability of Recursive Functions , 1963, JACM.

[114]  David Gries,et al.  Compiler Construction for Digital Computers , 1971 .

[115]  Sheila A. Greibach,et al.  The Hardest Context-Free Language , 1973, SIAM J. Comput..

[116]  H. P. Edmundson.  Language and information : Y. Bar-Hillel. Jerusalem Academic Press Ltd. and Addison-Wessley Publishing Co., Reading, Massachusetts, 1964 , 1966, Inf. Storage Retr..

[117]  Leslie G. Valiant,et al.  General Context-Free Recognition in Less than Cubic Time , 1975, J. Comput. Syst. Sci..

[118]  H. Shyr.  Free monoids and languages , 1979 .

[119]  Günter Hotz,et al.  On Parsing Coupled-Context-Free Languages , 1996, Theor. Comput. Sci..

[120]  Bernard Kolman,et al.  Discrete mathematical structures for computer science , 1988 .

[121]  Gaston H. Gonnet,et al.  Handbook Of Algorithms And Data Structures , 1984 .

[122]  C. Yates.  Recursive Functions , 1970, Nature.

[123]  Douglas Comer,et al.  Heuristics for trie index minimization , 1979, ACM Trans. Database Syst..

[124]  G. Rozenberg,et al.  Pumping Lemmas for Regular Sets , 1981, SIAM J. Comput..

[125]  Hans Hermes,et al.  Enumerability, decidability, computability , 1966 .

[126]  Sheila A. Greibach.  A generalization of Parikh's semilinear theorem , 1972, Discret. Math..

[127]  A. J. Kfoury,et al.  A Programming Approach to Computability , 1982, Texts and Monographs in Computer Science.

[128]  György E. Révész.  Introduction to formal languages , 1983 .

[129]  Gaston H. Gonnet,et al.  A constructive approach to the design of algorithms and their data structures , 1983, CACM.

[130]  Andrzej Ehrenfeucht,et al.  The (Generalized) Post Correspondence Problem with Lists Consisting of two Words is Decidable , 1982, Theor. Comput. Sci..

[131]  Dana S. Scott.  Some Definitional Suggestions for Automata Theory , 1967, J. Comput. Syst. Sci..

[132]  Donald E. Knuth,et al.  Big Omicron and big Omega and big Theta , 1976, SIGA.

[133]  Alfred V. Aho,et al.  The theory of parsing, translation, and compiling. 2: Compiling , 1973 .