Increasing Engagement in Automata Theory With JFLAP Susan H. Rodger Eric Wiebe Kyung Min Lee

Source URL: www.cs.duke.edu

• Theoretical computer science
• Computing
• Compiling tools
• Automata theory
• Theory of computation
• Parsing
• CYK algorithm
• LL parser
• Formal grammar
• Formal languages
• Mathematics
• Programming language implementation

Improving the graph grammar parser of Rekers and Sch¨urr Luka F¨ urst1 , Marjan Mernik2 , Viljan Mahniˇc1 1

Source URL: eprints.fri.uni-lj.si

• Combinatorics
• Compiler construction
• Graph rewriting
• Graph
• Context-free grammar
• Formal grammar
• CYK algorithm
• Tree
• Vertex
• Graph theory
• Formal languages
• Mathematics

SOI 2013 The Swiss Olympiad in Informatics Perfect solution

Source URL: www.soi.ch

• Analysis of algorithms
• Computational complexity theory
• Dynamic programming
• Algorithm
• Time complexity
• Big O notation
• Longest increasing subsequence
• CYK algorithm
• Theoretical computer science
• Mathematics
• Applied mathematics

A Better -Best List: Practical Determinization of Weighted Finite Tree Automata Jonathan May

Source URL: www.aclweb.org

• Theoretical computer science
• Computer science
• Computing
• CYK algorithm
• Finite state transducer
• Finite-state machine
• Parse tree
• Formal grammar
• Mehryar Mohri
• Automata theory
• Formal languages
• Models of computation

Binarization of Synchronous Context-Free Grammars Liang Huang∗ USC/Information Science Institute Hao Zhang∗∗

Source URL: www.aclweb.org

• Programming language implementation
• CYK algorithm
• Formal grammar
• Context-free grammar
• Earley parser
• Parsing
• Parse tree
• Stochastic context-free grammar
• Terminal and nonterminal symbols
• Formal languages
• Linguistics
• Science

A Genetic Algorithm for Grammars James Anderson and Joe Staines July 1, 2010 Background and Motivation Ribonucleic acid (RNA) secondary structure prediction is an important problem in molecular biology;

Source URL: www.stats.ox.ac.uk

• Linguistics
• Stochastic context-free grammar
• Context-free grammar
• Formal grammar
• CYK algorithm
• Ambiguous grammar
• Controlled grammar
• Straight-line grammar
• Formal languages
• Grammar
• Logic

On Dual Decomposition and Linear Programming Relaxations for Natural Language Processing Alexander M. Rush, David Sontag, Michael Collins, and Tommi Jaakkola

Source URL: people.csail.mit.edu

• Operations research
• CYK algorithm
• Linear programming
• Dynamic programming
• NP
• Shortest path problem
• Mathematical optimization
• Theoretical computer science
• Mathematics
• Applied mathematics

Seismogram Begin Time: [removed]:15:48 GMT Station: CYK - Cape Yakataga, AK, USA Station Location: Latitude[removed]N, Longitude[removed]W Time (s) 0.00

Source URL: rev.seis.sc.edu

Probabilistic Context-Free Grammar Induction Based on Structural Zeros Mehryar Mohri Courant Institute of Mathematical Sciences and Google Research 251 Mercer Street

Source URL: www.cs.nyu.edu

• Programming language implementation
• Theoretical computer science
• Bioinformatics
• Statistical natural language processing
• Stochastic context-free grammar
• CYK algorithm
• Parsing
• Context-free grammar
• Treebank
• Formal languages
• Linguistics
• Compiler construction

An Introduction to Synchronous Grammars David Chiang∗ 21 June[removed]Introduction Synchronous context-free grammars are a generalization of context-free grammars (CFGs) that generate

Source URL: www.isi.edu

• Mathematics
• CYK algorithm
• Context-free grammar
• Stochastic context-free grammar
• Parsing expression grammar
• Parse tree
• Synchronous context-free grammar
• Parsing
• P versus NP problem
• Formal languages
• Theoretical computer science
• Linguistics