scientific article; zbMATH DE number 7444003
From MaRDI portal
Publication:5016361
zbMath1483.68159arXiv1705.09093MaRDI QIDQ5016361
Matteo Pradella, Stefano Crespi Reghizzi
Publication date: 13 December 2021
Full work available at URL: https://arxiv.org/abs/1705.09093
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (2)
Beyond operator-precedence grammars and languages ⋮ Generalizing input-driven languages: theoretical and practical benefits
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Toward a theory of input-driven locally parsable languages
- Families of locally testable languages
- Operator precedence and the visibly pushdown property
- Operator Precedence Languages: Their Automata-Theoretic and Logic Characterization
- Tinput-Driven Pushdown Automata
- Adding nesting structure to words
- Identification in the Limit of k,l-Substitutable Context-Free Languages
- PAC-Learning Unambiguous k,l-NTS ≤ Languages
- Operator Precedence Grammars and the Noncounting Property
- Algebraic properties of operator precedence languages
- Syntactic Analysis and Operator Precedence
- Parsing Techniques
- Parenthesis Grammars
- A characterization of parenthesis languages
- The use of grammatical inference for designing programming languages
- Bounded context syntactic analysis
This page was built for publication:
