The Parikh Property for Weighted Context-Free Grammars
From MaRDI portal
DOI10.4230/LIPIcs.FSTTCS.2018.32MaRDI QIDQ5090971
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1810.01351
68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)
68Qxx: Theory of computing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parikh's theorem: a simple and direct automaton construction
- Analyzing Real-Time Event-Driven Programs
- The complexity of equivalence problems for commutative grammars
- The characterization of nonexpansive grammars by rational power series
- Extending Parikh’s Theorem to Weighted and Probabilistic Context-Free Grammars
- A few remarks on the index of context-free grammars and languages