arXiv (OAI Expanded)open access
Spectral and combinatorial methods for efficiently computing the rank of unambiguous finite automata
formal languages and automata theory, data structures and algorithms, symbolic computation
This document is indexed with metadata only — full text is not available in the archive for this record.
Open the official source ↗
Record · ID 789505
Retrieved via
Conceptio — every document is proof-bundled with source, license, and retrieval metadata.