Recognition and parsing of context-free languages in time n3

Cited In (86)

Bracket-languages are recognizable in logarithmic space
Forest alignment with affine gaps and anchors, applied in RNA structure comparison
Sparse RNA folding: time and space efficient algorithms
Deterministic multitape automata computations
BRNGLR: a cubic Tomita-style GLR parsing algorithm
Recognition of EOL languages in less than quartic time
The equivalence of four extensions of context-free grammars
Tape-reversal bounded Turing machine computations
Approximately matching context-free languages
Theory of formal grammars
Reflections on Optimal and Nearly Optimal Binary Search Trees
A method for automatic construction of ontological knowledge bases. I: Development of a semantic-syntactic model of natural language
A method for automatic construction of ontological knowledge bases. II: Automatic identification of semantic relations in ontological networks
If the current clique algorithms are optimal, so is Valiant's parser
Two complementary operations inspired by the DNA hairpin formation: Completion and reduction
On some algorithmic problems regarding the hairpin completion
The theory of languages
Membership for growing context-sensitive grammars is polynomial
Computing abstract decorations of parse forests using dynamic programming and algebraic power series
Parsing schemata and correctness of parsing algorithms
Conjunctive and Boolean grammars: the true general case of the context-free grammars
Wide-coverage efficient statistical parsing with CCG and log-linear models
The theory of languages
Error-repair parsing schemata
Fast uniform analysis of Coupled-Context-Free languages
Decision problems on path-controlled grammars
Applications of scheduling theory to formal language theory
Pattern selector grammars and several parsing algorithms in the context- free style
Interdependent translation schemes
Generalized sequential machine maps
Recognising \(k\)-connected hypergraphs in cubic time
Complete problems for deterministic polynomial time
Relationships between pushdown automata with counters and complexity classes
Definability and decidability issues in extensions of the integers with the divisibility predicate
Parallel on-line parsing in constant time per word
Efficient parallel and incremental parsing of practical context-free languages
Richard Bellman's contributions to computer science
Certified CYK parsing of context-free languages
Pushdown automata with counters
An efficient all-parses systolic algorithm for general context-free parsing
Manipulating derivation forests by scheduling techniques
Complexity of some problems concerningL systems
On parsing coupled-context-free languages
Earley's parsing algorithm and \(k\)-Petri net controlled grammars
A large neighbourhood search approach to the multi-activity shift scheduling problem
Boolean grammars
A CKY parser for picture grammars
Efficiency of pregroups and the French noun phrase
Analyzing Context-Free Grammars Using an Incremental SAT Solver
A unifying approach to picture grammars
Properties of syntax directed translations
Grammar semantics, analysis and parsing by abstract interpretation
An efficient automata approach to some problems on context-free grammars.
Formal languages for integer programming modeling of shift scheduling problems
Independent parallelism in finite copying parallel rewriting systems
Syntax directed translations and the pushdown assembler
Parallel parsing on a one-way linear array of finite-state machines
On the complexity of the recognition of parallel 2D-image languages
LR(0) conjunctive grammars and deterministic synchronized alternating pushdown automata
Storage requirements for deterministic polynomial time recognizable languages
A general context-free parsing algorithm running in linear time on every LR(k) grammar without using lookahead
The principle of optimality in the design of efficient algorithms
Sequentielle Analyse kontextfreier Sprachen
The tape-complexity of context-independent developmental languages
Computing a context-free grammar-generating series
Finding the smallest binarization of a CFG is NP-hard
Selected Decision Problems for Square-Refinement Collage Grammars
Efficient reconfigurable embedded parsers
Synchronous context-free grammars and optimal linear parsing strategies
Linear processing with pregroups
An error-correcting syntactic decoder for computer networks
Super-pattern matching
Path querying with conjunctive grammars by matrix multiplication
Recognition is not parsing - SPPF-style parsing from cubic recognisers
Title not available (Why is that?)
Tabulator-Turingmaschine und Komplexität. (Tabulator Turing machine and complexity)
Online perceptual learning and natural language acquisition for autonomous robots
Syntactic stochastic processes: definitions, models, and related inference problems
A computation model with automatic functions and relations as primitive operations
Computational aspects of mining maximal frequent patterns
Automating formalization by statistical and semantic parsing of mathematics
Learning to parse on aligned corpora (rough diamond)
Exploiting syntactic, semantic, and lexical regularities in language modeling via directed Markov random fields
Characterizations and extensions of pushdown translations
Representations of the language recognition problem for a theorem prover
One-variable context-free hedge automata

This page was built for publication: Recognition and parsing of context-free languages in time n3

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5528645)