Algebraic properties of operator precedence languages
From MaRDI portal
Publication:4155847
DOI10.1016/S0019-9958(78)90474-6zbMATH Open0377.68048WikidataQ57318716 ScholiaQ57318716MaRDI QIDQ4155847FDOQ4155847
Authors: Stefano Crespi Reghizzi, Dino Mandrioli, David Martin 
Publication date: 1978
Published in: Information and Control (Search for Journal in Brave)
Cited In (13)
- Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages
- Title not available (Why is that?)
- Toward a theory of input-driven locally parsable languages
- Operator precedence temporal logic and model checking
- Operator precedence and the visibly pushdown property
- Weighted operator precedence languages
- Beyond operator-precedence grammars and languages
- Operator Precedence Languages: Their Automata-Theoretic and Logic Characterization
- Title not available (Why is that?)
- Generalizing input-driven languages: theoretical and practical benefits
- Precedence automata and languages
- First-order logic definability of free languages
- Higher-order operator precedence languages
This page was built for publication: Algebraic properties of operator precedence languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4155847)
