Degrees of automata transformations
Uloženo v:
| Název: | Degrees of automata transformations |
|---|---|
| Autoři: | Bajrasheva, V. R. |
| Informace o vydavateli: | Kazan State University (Kazanskiĭ Gosudarstvennyĭ Universitet), Kazan |
| Témata: | category methods in recursion theory, Other degrees and reducibilities in computability and recursion theory, Formal languages and automata, Automata and formal grammars in connection with logical questions, Abstract and axiomatic computability and recursion theory, complete degrees |
| Popis: | Using the logical framework of \textit{G. Rejna} [Degrees of automata transformations (Russian) (Moscow, 1977)] and results of H. G. Gordon on complete degrees of finite-state transformability as points of entry, the author proves several category-theoretic results on complete degrees analogous to various results by J. Myhill and by H. Rogers on category methods in recursion theory. Some proofs make good use of Zorn's lemma in effective computability. |
| Druh dokumentu: | Article |
| Popis souboru: | application/xml |
| Přístupová URL adresa: | https://zbmath.org/3904569 |
| Přístupové číslo: | edsair.c2b0b933574d..307fd2c59ef3fde99c4d45cbbf53c1c2 |
| Databáze: | OpenAIRE |
Nájsť tento článok vo Web of Science | Abstrakt: | Using the logical framework of \textit{G. Rejna} [Degrees of automata transformations (Russian) (Moscow, 1977)] and results of H. G. Gordon on complete degrees of finite-state transformability as points of entry, the author proves several category-theoretic results on complete degrees analogous to various results by J. Myhill and by H. Rogers on category methods in recursion theory. Some proofs make good use of Zorn's lemma in effective computability. |
|---|