29 relations: Air Force Research Laboratory, Algorithm, Analysis of algorithms, Big O notation, Boolean matrix, Bottom-up parsing, Chomsky normal form, Computational complexity theory, Computational Intelligence (journal), Computer science, Context-free grammar, Coppersmith–Winograd algorithm, Courant Institute of Mathematical Sciences, Dynamic programming, Earley parser, Finite-state machine, GLR parser, Information and Computation, John Cocke, Journal of Computer and System Sciences, Journal of the ACM, New York University, Parse tree, Parsing, Parsing expression grammar, Probabilistic context-free grammar, Pseudocode, Tadao Kasami, The Art of Computer Programming.
The Air Force Research Laboratory (AFRL) is a scientific research organization operated by the United States Air Force Materiel Command dedicated to leading the discovery, development, and integration of affordable aerospace warfighting technologies, planning and executing the Air Force science and technology program, and providing warfighting capabilities to United States air, space, and cyberspace forces.
In mathematics and computer science, an algorithm is an unambiguous specification of how to solve a class of problems.
In computer science, the analysis of algorithms is the determination of the computational complexity of algorithms, that is the amount of time, storage and/or other resources necessary to execute them.
Big O notation is a mathematical notation that describes the limiting behaviour of a function when the argument tends towards a particular value or infinity.
In mathematics, a Boolean matrix is a matrix with entries from a Boolean algebra.
In computer science, parsing reveals the grammatical structure of linear input text, as a first step in working out its meaning.
In formal language theory, a context-free grammar G is said to be in Chomsky normal form (first described by Noam Chomsky) if all of its production rules are of the form: where A, B, and C are nonterminal symbols, a is a terminal symbol (a symbol that represents a constant value), S is the start symbol, and ε denotes the empty string.
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.
Computational Intelligence is a peer-reviewed scientific journal covering research on artificial intelligence.
Computer science deals with the theoretical foundations of information and computation, together with practical techniques for the implementation and application of these foundations.
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.
In linear algebra, the Coppersmith–Winograd algorithm, named after Don Coppersmith and Shmuel Winograd, was the asymptotically fastest known matrix multiplication algorithm until 2010.
The Courant Institute of Mathematical Sciences (CIMS) is an independent division of New York University (NYU) under the Faculty of Arts & Science that serves as a center for research and advanced training in computer science and mathematics.
Dynamic programming is both a mathematical optimization method and a computer programming method.
In computer science, the Earley parser is an algorithm for parsing strings that belong to a given context-free language, though (depending on the variant) it may suffer problems with certain nullable grammars.
A finite-state machine (FSM) or finite-state automaton (FSA, plural: automata), finite automaton, or simply a state machine, is a mathematical model of computation.
A GLR parser (GLR standing for "generalized LR", where L stands for "left-to-right" and R stands for "rightmost (derivation)") is an extension of an LR parser algorithm to handle nondeterministic and ambiguous grammars.
Information and Computation is a computer science journal published by Elsevier (formerly Academic Press).
John Cocke (May 30, 1925 – July 16, 2002) was an American computer scientist recognized for his large contribution to computer architecture and optimizing compiler design.
The Journal of Computer and System Sciences (JCSS) is a peer-reviewed scientific journal in the field of computer science.
The Journal of the ACM is a peer-reviewed scientific journal covering computer science in general, especially theoretical aspects.
New York University (NYU) is a private nonprofit research university based in New York City.
A parse tree or parsing tree or derivation tree or concrete syntax tree is an ordered, rooted tree that represents the syntactic structure of a string according to some context-free grammar.
Parsing, syntax analysis or syntactic analysis is the process of analysing a string of symbols, either in natural language, computer languages or data structures, conforming to the rules of a formal grammar.
In computer science, a parsing expression grammar, or PEG, is a type of analytic formal grammar, i.e. it describes a formal language in terms of a set of rules for recognizing strings in the language.
Grammar theory to model symbol strings originated from work in computational linguistics aiming to understand the structure of natural languages.
Pseudocode is an informal high-level description of the operating principle of a computer program or other algorithm.
was a noted Japanese information theorist who made significant contributions to error correcting codes.
The Art of Computer Programming (sometimes known by its initials TAOCP) is a comprehensive monograph written by Donald Knuth that covers many kinds of programming algorithms and their analysis.