The Parikh Property for Weighted Context-Free Grammars

DOI10.4230/LIPIcs.FSTTCS.2018.32OpenAlexW2962893768MaRDI QIDQ5090971

Pierre Ganty, Elena Gutiérrez

Publication date: 21 July 2022

Full work available at URL: https://arxiv.org/abs/1810.01351

zbMATH Keywords

Parikh imagealgebraic language theoryweighted context-free grammars

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

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

This page was built for publication: The Parikh Property for Weighted Context-Free Grammars