Pumping Lemmata for Recognizable Weighted Languages over Artinian Semirings

DOI10.4204/eptcs.386.13arXiv2309.02758WikidataQ124960522 ScholiaQ124960522MaRDI QIDQ6204133

Andreas Maletti, Unnamed Author

Publication date: 9 April 2024

Published in: Electronic Proceedings in Theoretical Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Handbook of weighted automata
• An Ogden-like iteration lemma for rational power series
• Un théorème de factorisation des produits d'endomorphismes de \(K^N\)
• Recognizable formal power series on trees
• Weighted automata
• The Support of a Recognizable Series over a Zero-sum Free, Commutative Semiring is Recognizable
• On the definition of a family of automata
• Rational and Recognisable Power Series
• Digital Image Compression
• Model Checking Linear-Time Properties of Probabilistic Systems
• Applications of Weighted Automata in Natural Language Processing
• On a Special Class of Recurrent Events

This page was built for publication: Pumping Lemmata for Recognizable Weighted Languages over Artinian Semirings