The support of a recognizable series over a zero-sum free, commutative semiring is recognizable

DOI10.14232/ACTACYB.20.2.2011.1zbMATH Open1265.68103OpenAlexW2398510482MaRDI QIDQ2915544FDOQ2915544

Authors: Daniel Kirsten 

Publication date: 18 September 2012

Published in: Acta Cybernetica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.14232/actacyb.20.2.2011.1

Recommendations

• 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
• An algebraic characterization of semirings for which the support of every recognizable series 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

supportweighted automatarecognizable series

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Cited In (20)

• The Support of a Recognizable Series over a Zero-Sum Free, Commutative Semiring Is Recognizable
• Weighted two-way transducers
• Compositions of Weighted Extended Tree Transducers — The Unambiguous Case
• Efficient weighted expressions conversion
• Weighted tree automata with constraints
• Finite sequentiality of finitely ambiguous max-plus tree automata
• Compositions with Constant Weighted Extended Tree Transducers
• Weighted tree automata with constraints
• Pumping Lemmata for Recognizable Weighted Languages over Artinian Semirings
• Solving the Weighted HOM-Problem With the Help of Unambiguity
• Weighted symbolic automata with data storage
• Weighted restarting 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 with storage
• Weighted automata
• Weighted two-way transducers
• An algebraic characterization of semirings for which the support of every recognizable series is recognizable
• Undecidability of the universal support problem for weighted automata over zero-sum-free commutative semirings
• An Algebraic Characterization of Semirings for Which the Support of Every Recognizable Series Is Recognizable

This page was built for publication: The support of a recognizable series over a zero-sum free, commutative semiring is recognizable

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