Parenthesis Grammars
From MaRDI portal
Publication:5553283
DOI10.1145/321406.321411zbMATH Open0168.01206DBLPjournals/jacm/McNaughton67OpenAlexW2294348221WikidataQ56573971 ScholiaQ56573971MaRDI QIDQ5553283FDOQ5553283
Authors: Robert McNaughton 
Publication date: 1967
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321406.321411
Cited In (52)
- Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages
- Weighted operator precedence languages
- Inference for regular bilanguages
- Model-checking structured context-free languages
- Decidability of EDT0L structural equivalence
- Title not available (Why is that?)
- Die Verwandtschaft kontextfreier Grammatiken
- UNSOLVABILITY LEVELS OF OPERATION PROBLEMS FOR SUBCLASSES OF CONTEXT-FREE LANGUAGES
- Complexity of E0L structural equivalence
- Theory of formal grammars
- Language learning from membership queries and characteristic examples
- Title not available (Why is that?)
- The strong equivalence of ET0L grammars
- The word problem for visibly pushdown languages described by grammars
- Comparing linear conjunctive languages to subfamilies of the context-free languages
- The theory of languages
- Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
- Title not available (Why is that?)
- On the equivalence, containment, and covering problems for the regular and context-free languages
- Structural equivalence and ET0L grammars
- The theory of languages
- Toward a theory of input-driven locally parsable languages
- Operator precedence temporal logic and model checking
- Decidability of structural equivalence of E0L grammars
- On strict interpretations of grammar forms
- Sofic-Dyck shifts
- NTS languages are deterministic and congruential
- Defining families of trees with E0L grammars
- Propositional dynamic logic with recursive programs
- Title not available (Why is that?)
- Tree correspondence problems
- Title not available (Why is that?)
- Operator precedence and the visibly pushdown property
- Logic and linguistics meeting, Stanford, 1987
- Complexity of E0L structural equivalence
- The equivalence and inclusion problems for NTS languages
- Weighted operator precedence languages
- Beyond operator-precedence grammars and languages
- Structural equivalence of context-free grammars
- The covering problem for linear context-free grammars
- Generalized parenthesis languages and minimization of their parenthesis parts
- Efficient learning of context-free grammars from positive structural examples
- Operator Precedence Languages: Their Automata-Theoretic and Logic Characterization
- A formal specification of document processing
- Nest sets and relativized closure properties
- Title not available (Why is that?)
- On equivalence and subclass containment problems for deterministic context-free languages
- Generalizing input-driven languages: theoretical and practical benefits
- First-order logic definability of free languages
- Remarques sur les langages de parenthèses
- n-reconstructability of context-free grammars
- Higher-order operator precedence languages
This page was built for publication: Parenthesis Grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5553283)
