An algebraic characterization of semirings for which the support of every recognizable series is recognizable

DOI10.1016/J.TCS.2014.02.035zbMATH Open1358.68203OpenAlexW2088421253MaRDI QIDQ2447754FDOQ2447754

Authors: Daniel Kirsten 

Publication date: 29 April 2014

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.02.035

Recommendations

• An Algebraic Characterization of Semirings for Which the Support of Every Recognizable Series Is Recognizable
• The support of a recognizable series over a zero-sum free, commutative semiring is recognizable
• The Support of a Recognizable Series over a Zero-Sum Free, Commutative Semiring Is Recognizable
• On the supports of recognizable series over a field and a single letter alphabet
• Recognizability of the support of recognizable series over the semiring of the integers is undecidable

zbMATH Keywords

formal power seriesrecognizable languagessemirings

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Semirings (16Y60)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Handbook of weighted automata
• Title not available (Why is that?)
• On the definition of a family of automata
• On rational series and rational languages
• Title not available (Why is that?)
• Algebraic automata and context-free sets
• On some questions of rationality and decidability
• Title not available (Why is that?)
• The Support of a Recognizable Series over a Zero-Sum Free, Commutative Semiring Is Recognizable
• On the supports of recognizable series over a field and a single letter alphabet
• An Algebraic Characterization of Semirings for Which the Support of Every Recognizable Series Is Recognizable

Cited In (10)

• The Support of a Recognizable Series over a Zero-Sum Free, Commutative Semiring Is Recognizable
• Bideterministic weighted automata
• Equivalence, Unambiguity, and Sequentiality of Finitely Ambiguous Max-Plus Tree Automata
• Bideterministic weighted automata
• On the supports of recognizable series over a field and a single letter alphabet
• Recognizability of the support of recognizable series over the semiring of the integers is undecidable
• Weighted automata
• The support of a recognizable series over a zero-sum free, commutative semiring is recognizable
• An Algebraic Characterization of Semirings for Which the Support of Every Recognizable Series Is Recognizable
• On some decidability questions concerning supports of rational series

This page was built for publication: An algebraic characterization of semirings for which the support of every recognizable series is recognizable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2447754)