A class of unambiguous computer languages
Communications of the ACM
Bounded context syntactic analysis
Communications of the ACM
On the inference of canonical context-free grammars
ACM SIGACT News
The Boolean formula value problem is in ALOGTIME
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Efficient algorithms for automatic construction and compactification of parsing
ACM Transactions on Programming Languages and Systems (TOPLAS)
Learnability of CFLs: inferring syntactic models from constituent structure
ACM SIGART Bulletin - Special issue on knowledge acquisition
On the Covering and Reduction Problems for Context-Free Grammars
Journal of the ACM (JACM)
An Observation on Relative Parsing Time
Journal of the ACM (JACM)
Log Space Recognition and Translation of Parenthesis Languages
Journal of the ACM (JACM)
Noncounting Context-Free Languages
Journal of the ACM (JACM)
Stack Machines and Classes of Nonnested Macro Languages
Journal of the ACM (JACM)
Superdeterministic PDAs: A Subcase with a Decidable Inclusion problem
Journal of the ACM (JACM)
Inference of Reversible Languages
Journal of the ACM (JACM)
Decidability of EDT0L structural equivalence
Theoretical Computer Science
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Balanced Grammars and Their Languages
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
On the Parallel Complexity of Tree Automata
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Prediction-Preserving Reducibility with Membership Queries on Formal Languages
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Balanced grammars and their languages
Formal and natural computing
Typing and querying XML documents: some complexity bounds
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Computational parallels between the regular and context-free languages
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
On some families of languages related to the Dyck language
STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Some properties of precedence languages
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
The influence of productions on derivations and parsing (Extended Abstract)
POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Learning context-free languages from their structured sentences
ACM SIGACT News
The complexity of XPath query evaluation and XML typing
Journal of the ACM (JACM)
Sample selection for statistical grammar induction
EMNLP '00 Proceedings of the 2000 Joint SIGDAT conference on Empirical methods in natural language processing and very large corpora: held in conjunction with the 38th Annual Meeting of the Association for Computational Linguistics - Volume 13
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Tree Systems for Syntactic Pattern Recognition
IEEE Transactions on Computers
The word problem for visibly pushdown languages described by grammars
Formal Methods in System Design
Model Checking: From Tools to Theory
25 Years of Model Checking
Type inference and type checking for queries on execution traces
Proceedings of the VLDB Endowment
Querying web-based applications under models of uncertainty
Proceedings of the VLDB Endowment
Adding nesting structure to words
Journal of the ACM (JACM)
Efficient learning of context-free grammars from positive structural examples
Information and Computation
On the equivalence, containment, and covering problems for the regular and context-free languages
Journal of Computer and System Sciences
Structural equivalence of context-free grammars
Journal of Computer and System Sciences
Complexity results on balanced context-free languages
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Comparing linear conjunctive languages to subfamilies of the context-free languages
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Type inference and type checking for queries over execution traces
The VLDB Journal — The International Journal on Very Large Data Bases
Some non-semi-decidability problems for linear and deterministic context-free languages
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
On the membership problem for visibly pushdown languages
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Operator precedence and the visibly pushdown property
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Adding nesting structure to words
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
XML validation for context-free grammars
APLAS'06 Proceedings of the 4th Asian conference on Programming Languages and Systems
Associative definition of programming languages
Computer Languages
A formal specification of document processing
Mathematical and Computer Modelling: An International Journal
Operator precedence and the visibly pushdown property
Journal of Computer and System Sciences
Grammatical Codes Of Trees And Terminally Coded Grammars
Fundamenta Informaticae
Minimizing variants of visibly pushdown automata
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.01 |
A decision procedure is given which determines whether the languages defined by two parenthesis grammars are equal.