arXiv (All)
open access
Spectral and combinatorial methods for efficiently computing the rank of unambiguous finite automata
A zero-one matrix is a matrix with entries from $\{0, 1\}$. We study monoids containing only such matrices. A finite set of zero-one matrices generating such a monoid can be seen as the matrix representation of an unambiguous finite automaton, an important generalisation of deterministic finite auto
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
- Spectral and combinatorial methods for efficiently computing the rank of unambiguous finite automata#789505
- Update to: Spectral sets: Numerical range and beyond#1037143
- History-Deterministic Büchi Automata are Succinct#1012145
- Finitely presented groups with transcendental spectral radius#160803
- Tree metrics and log-concavity for matroids#1014587
Record · ID 793509
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