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