Two Families of Languages Related to ALGOL
Journal of the ACM (JACM)
Syntactic Analysis and Operator Precedence
Journal of the ACM (JACM)
Design of a separable transition-diagram compiler
Communications of the ACM
An error-correcting parse algorithm
Communications of the ACM
Ambiguity in context-free grammars
SAC '95 Proceedings of the 1995 ACM symposium on Applied computing
Matrix Equations and Normal Forms for Context-Free Grammars
Journal of the ACM (JACM)
One-way nondeterministic real-time list-storage languages
Journal of the ACM (JACM)
Indexed Grammars—An Extension of Context-Free Grammars
Journal of the ACM (JACM)
An Infinite Hierarchy of Context-Free Languages
Journal of the ACM (JACM)
Deterministic Pushdown Store Machines and Real-Time Computation
Journal of the ACM (JACM)
Journal of the ACM (JACM)
The Halting Problem for Probabilistic Context-Free Generators
Journal of the ACM (JACM)
On the Covering and Reduction Problems for Context-Free Grammars
Journal of the ACM (JACM)
Journal of the ACM (JACM)
A Formalization of Transition Diagram Systems
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Superdeterministic PDAs: A Subcase with a Decidable Inclusion problem
Journal of the ACM (JACM)
A Supernormal-Form Theorem for Context-Free Grammars
Journal of the ACM (JACM)
The role of programming in a Ph.D. computer science program
Communications of the ACM
Information science in a Ph.D. computer science program
Communications of the ACM
Computational linguistics in a Ph.D. computer science program
Communications of the ACM
The predictive analyzer and a path elimination technique
Communications of the ACM
The augmented predictive analyzer for context-free languages—its relative efficiency
Communications of the ACM
An object-oriented LL(1) parser generator
ACM SIGPLAN Notices
Normal form algorithms for extended context-free grammars
Theoretical Computer Science
Forty years of formal power series in automata theory
A half-century of automata theory
Parsing Electronic Circuits in a Logic Grammar
IEEE Transactions on Knowledge and Data Engineering
Extended Context-Free Grammars and Normal Form Algorithms
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
Greibach Normal Form in Algebraically Complete Semirings
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Properties of deterministic top down grammars
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Pushdown store machines and real-time computation
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
On the formulation of normal pushdown acceptors
ACM '68 Proceedings of the 1968 23rd ACM national conference
The construction of recognizers
ACM '66 Proceedings of the 1966 21st national conference
Removing left recursion from context-free grammars
NAACL 2000 Proceedings of the 1st North American chapter of the Association for Computational Linguistics conference
The weak generative capacity of parenthesis-free categorial grammars
COLING '86 Proceedings of the 11th coference on Computational linguistics
Roots of the hardest context free language and other constructs
ACM SIGACT News
Ambiguity in Graphs and Expressions
IEEE Transactions on Computers
Identification in the Limit of k,l-Substitutable Context-Free Languages
ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
A Logic Grammar for Circuit Analysis
KES '07 Knowledge-Based Intelligent Information and Engineering Systems and the XVII Italian Workshop on Neural Networks on Proceedings of the 11th International Conference
Conjunctive Grammars with Restricted Disjunction
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
An elementary proof of a generalization of double Greibach normal form
Information Processing Letters
The vocal speech understanding system
IJCAI'75 Proceedings of the 4th international joint conference on Artificial intelligence - Volume 1
On stochastic context-free languages
Information Sciences: an International Journal
Journal of Computer and System Sciences
Properties of syntax directed translations
Journal of Computer and System Sciences
A homomorphism theorem for weighted context-free grammars
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Time-bounded grammars and their languages
Journal of Computer and System Sciences
Conjunctive grammars with restricted disjunction
Theoretical Computer Science
A play on regular expressions: functional pearl
Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
A formalisation of the normal forms of context-free grammars in HOL4
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
String analysis as an abstract interpretation
VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
Immunity and pseudorandomness of context-free languages
Theoretical Computer Science
Context-free languages, coalgebraically
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Abstract automata and a normal form for categorial dependency grammars
LACL'12 Proceedings of the 7th international conference on Logical Aspects of Computational Linguistics
| Hi-index | 0.10 |