Decompositions of finite-to-one factor maps

Autor:	Paul Trow
Rok vydání:	1995
Předmět:	Combinatorics Conjugacy class Degree (graph theory) General Mathematics Factor (programming language) Algebra over a field Type (model theory) Closing (morphology) computer Versa Irreducible component computer.programming_language Mathematics
Zdroj:	Israel Journal of Mathematics. 91:129-155
ISSN:	1565-8511 0021-2172
Popis:	We examine the question of when a finite-to-one factor map θ: ∑A →S, from a shift of finite type onto a sofic shift, can be decomposed as a left closing map (onto a shift of finite type) followed by a right closing map (or vice versa). We give a finite procedure for deciding this question. In general, we show that there are finitely many such decompositions, up to conjugacy. If the degree of θ is one, then there is at most one such decomposition.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::b84fb3fd6378d6adbbe87ee7fe0d9f16 https://doi.org/10.1007/bf02761643 Zobrazit plný text záznamu Full text from SpringerLink