Algorithmic Complexity for the Realization of an Effective Subshift By a Sofic.

DOI10.4230/LIPICS.ICALP.2016.110zbMath1388.68134OpenAlexW2569219325MaRDI QIDQ4598251

No author found.

Publication date: 19 December 2017

Full work available at URL: https://dblp.uni-trier.de/db/conf/icalp/icalp2016.html#SablikS16

zbMATH Keywords

tilingstime complexitycomputabilitysubshiftspace complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial aspects of tessellation and tiling problems (05B45) Symbolic dynamics (37B10)

Related Items (1)

Turing degree spectra of minimal subshifts

This page was built for publication: Algorithmic Complexity for the Realization of an Effective Subshift By a Sofic.