Parenthesis Grammars
From MaRDI portal
Publication:5553283
DOI10.1145/321406.321411zbMath0168.01206DBLPjournals/jacm/McNaughton67OpenAlexW2294348221WikidataQ56573971 ScholiaQ56573971MaRDI QIDQ5553283
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
Related Items (52)
The theory of languages ⋮ The equivalence and inclusion problems for NTS languages ⋮ NTS languages are deterministic and congruential ⋮ The strong equivalence of ET0L grammars ⋮ Model-checking structured context-free languages ⋮ Equivalences and transformations of regular systems - applications to recursive program schemes and grammars ⋮ The theory of languages ⋮ Propositional dynamic logic with recursive programs ⋮ First-Order Logic Definability of Free Languages ⋮ A formal specification of document processing ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Operator Precedence Languages: Their Automata-Theoretic and Logic Characterization ⋮ Complexity of EOL structural equivalence ⋮ Beyond operator-precedence grammars and languages ⋮ Language learning from membership queries and characteristic examples ⋮ Sofic-Dyck shifts ⋮ Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages ⋮ Unnamed Item ⋮ Generalizing input-driven languages: theoretical and practical benefits ⋮ Unnamed Item ⋮ Tree correspondence problems ⋮ Unnamed Item ⋮ Operator precedence temporal logic and model checking ⋮ Unnamed Item ⋮ Nest sets and relativized closure properties ⋮ Complexity of E0L structural equivalence ⋮ Defining families of trees with E0L grammars ⋮ The word problem for visibly pushdown languages described by grammars ⋮ Efficient learning of context-free grammars from positive structural examples ⋮ Structural equivalence and ET0L grammars ⋮ Logic and linguistics meeting, Stanford, 1987 ⋮ Operator precedence and the visibly pushdown property ⋮ On the equivalence, containment, and covering problems for the regular and context-free languages ⋮ n-reconstructability of context-free grammars ⋮ The covering problem for linear context-free grammars ⋮ Inference for regular bilanguages ⋮ Toward a theory of input-driven locally parsable languages ⋮ Unnamed Item ⋮ On equivalence and subclass containment problems for deterministic context-free languages ⋮ Comparing Linear Conjunctive Languages to Subfamilies of the Context-Free Languages ⋮ UNSOLVABILITY LEVELS OF OPERATION PROBLEMS FOR SUBCLASSES OF CONTEXT-FREE LANGUAGES ⋮ Die Verwandtschaft kontextfreier Grammatiken ⋮ Structural equivalence of context-free grammars ⋮ Weighted operator precedence languages ⋮ On strict interpretations of grammar forms ⋮ Weighted Operator Precedence Languages ⋮ Theory of formal grammars ⋮ Generalized parenthesis languages and minimization of their parenthesis parts ⋮ Remarques sur les langages de parenthèses ⋮ Decidability of structural equivalence of E0L grammars ⋮ Decidability of EDT0L structural equivalence
This page was built for publication: Parenthesis Grammars
