arXiv (All)
open access
Graphoid Automata, Frobenius PROPs, and Semiring Evaluation
Graphoid automata evaluate graphs by composing relations between words of states. We examine the equations that make this evaluation independent of the chosen graph expression, and what changes when relations are replaced by matrices over a commutative semiring. We prove that the classical graphoid
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Foundations of the GraphAlg Language#10453
- Word-representability of minimal non-comparability graphs and covering word-representable graphs by comparability graphs#177036
- GraphFAS: A Distributed System for Automated Graph Feature Generation and Selection in Industrial Transaction Networks#667976
- Introduction to computational linguistics#470378
- Sub-quorum colorings of graphs#1051621
Record · ID 1199171
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive