A unifying approach to algebraic systems over semirings
DOI10.1007/S00224-018-9895-9zbMATH Open1431.68067OpenAlexW2900393059WikidataQ128993566 ScholiaQ128993566MaRDI QIDQ2000006FDOQ2000006
Authors: Peter Kostolányi 
Publication date: 27 June 2019
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-018-9895-9
Recommendations
algebraic systems of equationssummation semiringsweighted context-free grammarsweighted context-free languagesweighted pushdown automataChomsky-Schützenberger theorem
Grammars and rewriting systems (68Q42) Algebraic theory of languages and automata (68Q70) Semirings (16Y60)
Cites Work
- Elements of automata theory. Translated from the French by Reuben Thomas
- Title not available (Why is that?)
- Title not available (Why is that?)
- Handbook of weighted automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Semirings and Formal Power Series
- Inductive \(^{*}\)-semirings
- Title not available (Why is that?)
- A unifying Kleene theorem for weighted finite automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- A homomorphism theorem for weighted context-free grammars
- Automata with Auxiliary Weights
- Algebraic systems and pushdown automata
- The Chomsky-Schützenberger theorem for quantitative context-free languages
Cited In (2)
This page was built for publication: A unifying approach to algebraic systems over semirings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2000006)
