Faster access than browser!
36 relations: Abstract family of acceptors, ALGOL 68, Applied mathematics, Automaton, California, Compiler, Computational complexity theory, Computer science, Context-free grammar, Context-sensitive grammar, Decision problem, Deterministic context-free language, Formal language, Greibach normal form, Greibach's theorem, Harvard University, Jean Gallier, Journal of the ACM, Latin honors, Linguistics, Michael A. Harrison, Michael J. Fischer, Natural language, New York (state), New York City, Pushdown automaton, Radcliffe College, Ronald V. Book, Seymour Ginsburg, Symposium on Foundations of Computer Science, Syntax-directed translation, Theoretical computer science, Turing machine, United States, University of California, Los Angeles, Van Wijngaarden grammar.
Abstract family of acceptors
An abstract family of acceptors (AFA) is a grouping of generalized acceptors.
New!!: Sheila Greibach and Abstract family of acceptors · See more »
ALGOL 68
ALGOL 68 (short for Algorithmic Language 1968) is an imperative computer programming language that was conceived as a successor to the ALGOL 60 programming language, designed with the goal of a much wider scope of application and more rigorously defined syntax and semantics.
New!!: Sheila Greibach and ALGOL 68 · See more »
Applied mathematics
Applied mathematics is the application of mathematical methods by different fields such as science, engineering, business, computer science, and industry.
New!!: Sheila Greibach and Applied mathematics · See more »
Automaton
An automaton (plural: automata or automatons) is a self-operating machine, or a machine or control mechanism designed to automatically follow a predetermined sequence of operations, or respond to predetermined instructions.
New!!: Sheila Greibach and Automaton · See more »
California
California is a state in the Pacific Region of the United States.
New!!: Sheila Greibach and California · See more »
Compiler
A compiler is computer software that transforms computer code written in one programming language (the source language) into another programming language (the target language).
New!!: Sheila Greibach and Compiler · See more »
Computational complexity theory
Computational complexity theory is a branch of the theory of computation in theoretical computer science that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other.
New!!: Sheila Greibach and Computational complexity theory · See more »
Computer science
Computer science deals with the theoretical foundations of information and computation, together with practical techniques for the implementation and application of these foundations.
New!!: Sheila Greibach and Computer science · See more »
Context-free grammar
In formal language theory, a context-free grammar (CFG) is a certain type of formal grammar: a set of production rules that describe all possible strings in a given formal language.
New!!: Sheila Greibach and Context-free grammar · See more »
Context-sensitive grammar
A context-sensitive grammar (CSG) is a formal grammar in which the left-hand sides and right-hand sides of any production rules may be surrounded by a context of terminal and nonterminal symbols.
New!!: Sheila Greibach and Context-sensitive grammar · See more »
Decision problem
In computability theory and computational complexity theory, a decision problem is a problem that can be posed as a yes-no question of the input values.
New!!: Sheila Greibach and Decision problem · See more »
Deterministic context-free language
In formal language theory, deterministic context-free languages (DCFL) are a proper subset of context-free languages.
New!!: Sheila Greibach and Deterministic context-free language · See more »
Formal language
In mathematics, computer science, and linguistics, a formal language is a set of strings of symbols together with a set of rules that are specific to it.
New!!: Sheila Greibach and Formal language · See more »
Greibach normal form
In formal language theory, a context-free grammar is in Greibach normal form (GNF) if the right-hand sides of all production rules start with a terminal symbol, optionally followed by some variables.
New!!: Sheila Greibach and Greibach normal form · See more »
Greibach's theorem
In theoretical computer science, in particular in formal language theory, Greibach's theorem states that certain properties of formal language classes are undecidable.
New!!: Sheila Greibach and Greibach's theorem · See more »
Harvard University
Harvard University is a private Ivy League research university in Cambridge, Massachusetts.
New!!: Sheila Greibach and Harvard University · See more »
Jean Gallier
Jean Henri Gallier (b. 1949) is a researcher in computational logic at the University of Pennsylvania, where he holds appointments in the Computer and Information Science Department and the Department of Mathematics.
New!!: Sheila Greibach and Jean Gallier · See more »
Journal of the ACM
The Journal of the ACM is a peer-reviewed scientific journal covering computer science in general, especially theoretical aspects.
New!!: Sheila Greibach and Journal of the ACM · See more »
Latin honors
Latin honors are Latin phrases used to indicate the level of distinction with which an academic degree has been earned.
New!!: Sheila Greibach and Latin honors · See more »
Linguistics
Linguistics is the scientific study of language, and involves an analysis of language form, language meaning, and language in context.
New!!: Sheila Greibach and Linguistics · See more »
Michael A. Harrison
Michael A. Harrison is a computer scientist, in particular a pioneer in the area of formal languages.
New!!: Sheila Greibach and Michael A. Harrison · See more »
Michael J. Fischer
Michael John Fischer (born 1942) is a computer scientist who works in the fields of distributed computing, parallel computing, cryptography, algorithms and data structures, and computational complexity.
New!!: Sheila Greibach and Michael J. Fischer · See more »
Natural language
In neuropsychology, linguistics, and the philosophy of language, a natural language or ordinary language is any language that has evolved naturally in humans through use and repetition without conscious planning or premeditation.
New!!: Sheila Greibach and Natural language · See more »
New York (state)
New York is a state in the northeastern United States.
New!!: Sheila Greibach and New York (state) · See more »
New York City
The City of New York, often called New York City (NYC) or simply New York, is the most populous city in the United States.
New!!: Sheila Greibach and New York City · See more »
Pushdown automaton
In the theory of computation, a branch of theoretical computer science, a pushdown automaton (PDA) is a type of automaton that employs a stack.
New!!: Sheila Greibach and Pushdown automaton · See more »
Radcliffe College
Radcliffe College was a women's liberal arts college in Cambridge, Massachusetts, and functioned as a female coordinate institution for the all-male Harvard College.
New!!: Sheila Greibach and Radcliffe College · See more »
Ronald V. Book
Ronald Vernon Book (March 5 1937 – May 28, 1997 in Santa Barbara, California) worked in theoretical computer science.
New!!: Sheila Greibach and Ronald V. Book · See more »
Seymour Ginsburg
Seymour Ginsburg (December 12, 1927 – December 5, 2004) was an American pioneer of automata theory, formal language theory, and database theory, in particular; and computer science, in general.
New!!: Sheila Greibach and Seymour Ginsburg · See more »
Symposium on Foundations of Computer Science
The IEEE Annual Symposium on Foundations of Computer Science (FOCS) is an academic conference in the field of theoretical computer science.
New!!: Sheila Greibach and Symposium on Foundations of Computer Science · See more »
Syntax-directed translation
Syntax-directed translation refers to a method of compiler implementation where the source language translation is completely driven by the parser.
New!!: Sheila Greibach and Syntax-directed translation · See more »
Theoretical computer science
Theoretical computer science, or TCS, is a subset of general computer science and mathematics that focuses on more mathematical topics of computing and includes the theory of computation.
New!!: Sheila Greibach and Theoretical computer science · See more »
Turing machine
A Turing machine is a mathematical model of computation that defines an abstract machine, which manipulates symbols on a strip of tape according to a table of rules.
New!!: Sheila Greibach and Turing machine · See more »
United States
The United States of America (USA), commonly known as the United States (U.S.) or America, is a federal republic composed of 50 states, a federal district, five major self-governing territories, and various possessions.
New!!: Sheila Greibach and United States · See more »
University of California, Los Angeles
The University of California, Los Angeles (UCLA) is a public research university in the Westwood district of Los Angeles, United States.
New!!: Sheila Greibach and University of California, Los Angeles · See more »
Van Wijngaarden grammar
In computer science, a Van Wijngaarden grammar (also vW-grammar or W-grammar) is a two-level grammar which provides a technique to define potentially infinite context-free grammars in a finite number of rules.
New!!: Sheila Greibach and Van Wijngaarden grammar · See more »
References
[1] https://en.wikipedia.org/wiki/Sheila_Greibach
