Parenthesis Grammars
From MaRDI portal
Publication:5553283
Cited in
(52)- Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages
- n-reconstructability of context-free grammars
- Operator Precedence Languages: Their Automata-Theoretic and Logic Characterization
- Logic and linguistics meeting, Stanford, 1987
- Complexity of E0L structural equivalence
- Generalizing input-driven languages: theoretical and practical benefits
- Model-checking structured context-free languages
- The covering problem for linear context-free grammars
- Die Verwandtschaft kontextfreier Grammatiken
- Comparing linear conjunctive languages to subfamilies of the context-free languages
- The strong equivalence of ET0L grammars
- Theory of formal grammars
- A formal specification of document processing
- Language learning from membership queries and characteristic examples
- Operator precedence and the visibly pushdown property
- Structural equivalence of context-free grammars
- scientific article; zbMATH DE number 3872710 (Why is no real title available?)
- Nest sets and relativized closure properties
- Defining families of trees with E0L grammars
- The word problem for visibly pushdown languages described by grammars
- The equivalence and inclusion problems for NTS languages
- Weighted operator precedence languages
- Higher-order operator precedence languages
- Propositional dynamic logic with recursive programs
- UNSOLVABILITY LEVELS OF OPERATION PROBLEMS FOR SUBCLASSES OF CONTEXT-FREE LANGUAGES
- Complexity of E0L structural equivalence
- On strict interpretations of grammar forms
- NTS languages are deterministic and congruential
- The theory of languages
- Toward a theory of input-driven locally parsable languages
- scientific article; zbMATH DE number 7447741 (Why is no real title available?)
- Tree correspondence problems
- First-order logic definability of free languages
- Decidability of EDT0L structural equivalence
- The theory of languages
- scientific article; zbMATH DE number 3707792 (Why is no real title available?)
- Operator precedence temporal logic and model checking
- Weighted operator precedence languages
- Sofic-Dyck shifts
- Beyond operator-precedence grammars and languages
- Generalized parenthesis languages and minimization of their parenthesis parts
- On the equivalence, containment, and covering problems for the regular and context-free languages
- scientific article; zbMATH DE number 3677223 (Why is no real title available?)
- Decidability of structural equivalence of E0L grammars
- On equivalence and subclass containment problems for deterministic context-free languages
- Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
- Structural equivalence and ET0L grammars
- Remarques sur les langages de parenthèses
- Efficient learning of context-free grammars from positive structural examples
- scientific article; zbMATH DE number 7577575 (Why is no real title available?)
- Inference for regular bilanguages
- scientific article; zbMATH DE number 3735179 (Why is no real title available?)
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)
