The Chomsky-Schützenberger Theorem for Quantitative Context-Free Languages
From MaRDI portal
Publication:5300841
DOI10.1007/978-3-642-38771-5_19zbMath1381.68114arXiv1208.3942OpenAlexW2147884289MaRDI QIDQ5300841
Publication date: 28 June 2013
Published in: Developments in Language Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1208.3942
Related Items (5)
Weighted iterated linear control ⋮ Weighted automata with storage ⋮ Characterizations of recognizable weighted tree languages by logic and bimorphisms ⋮ Weighted Symbolic Automata with Data Storage ⋮ Weighted automata
This page was built for publication: The Chomsky-Schützenberger Theorem for Quantitative Context-Free Languages