{"paper":{"title":"Retractable state-finite automata without outputs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Attila Nagy","submitted_at":"2015-10-04T08:05:41Z","abstract_excerpt":"A homomorphism of an automaton ${\\bf A}$ without outputs onto a subautomaton ${\\bf B}$ of ${\\bf A}$ is called a retract homomorphism if it leaves the elements of $B$ fixed. An automaton ${\\bf A}$ is called a retractable automaton if, for every subautomaton ${\\bf B}$ of ${\\bf A}$, there is a retract homomorphism of ${\\bf A}$ onto ${\\bf B}$. In [1] and [3], special retractable automata are examined. The purpose of this paper is to give a complete description of state-finite retractable automata without outputs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.00911","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}