The Parikh Property for Weighted Context-Free Grammars
From MaRDI portal
Publication:5090971
DOI10.4230/LIPICS.FSTTCS.2018.32OpenAlexW2962893768MaRDI QIDQ5090971FDOQ5090971
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1810.01351
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)
Cites Work
- A uniform framework for problems on context-free grammars
- Title not available (Why is that?)
- Parikh's theorem: a simple and direct automaton construction
- Title not available (Why is that?)
- Title not available (Why is that?)
- The complexity of equivalence problems for commutative grammars
- Title not available (Why is that?)
- The characterization of nonexpansive grammars by rational power series
- A few remarks on the index of context-free grammars and languages
- Analyzing Real-Time Event-Driven Programs
- Extending Parikh’s Theorem to Weighted and Probabilistic Context-Free Grammars
Cited In (2)
This page was built for publication: The Parikh Property for Weighted Context-Free Grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090971)