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