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

DOI10.1016/J.TCS.2014.02.035MaRDI QIDQ2447754zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

formal power seriesrecognizable languagessemirings

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 3915644 (Why is no real title available?)
• scientific article; zbMATH DE number 3660804 (Why is no real title available?)
• scientific article; zbMATH DE number 3588051 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• scientific article; zbMATH DE number 848098 (Why is no real title available?)
• Algebraic automata and context-free sets
• An Algebraic Characterization of Semirings for Which the Support of Every Recognizable Series Is Recognizable
• Handbook of weighted automata
• On rational series and rational languages
• On some questions of rationality and decidability
• On the definition of a family of automata
• On the supports of recognizable series over a field and a single letter alphabet
• The Support of a Recognizable Series over a Zero-Sum Free, Commutative Semiring 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)