arXiv (OAI)open access
A Myhill-Nerode Theorem for Generalized Automata, with Applications to Pattern Matching and Compression
formal languages and automata theory, data structures and algorithms, logic in computer science
This document is indexed with metadata only — full text is not available in the archive for this record.
Open the official source ↗
Related documents
Record · ID 158602
Retrieved via
Conceptio — every document is proof-bundled with source, license, and retrieval metadata.