Reducing the local alphabet size in tiling systems by means of 2D comma-free codes
From MaRDI portal
Publication:2676458
DOI10.1016/j.tcs.2022.09.010OpenAlexW4295531232MaRDI QIDQ2676458
Pierluigi San Pietro, Antonio Restivo, Stefano Crespi Reghizzi
Publication date: 27 September 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2206.05208
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Periodicity in rectangular arrays
- Non-expandable non-overlapping sets of pictures
- Two-dimensional comma-free and cylindric codes
- Reducing local alphabet size in recognizable picture languages
- Classifying regular events in symbolic logic
- Properties of code events and homomorphisms over regular events
- Monadic second-order logic over rectangular pictures and recognizability by tiling systems
- Two-dimensional models
- Regular languages as local functions with small alphabets
- Homomorphic characterization of tree languages based on comma-free encoding
- Hall sets, Lazard sets and comma-free codes
- FROM REGULAR TO STRICTLY LOCALLY TESTABLE LANGUAGES
- Comma-Free Codes
- A characterization of strictly locally testable languages and its application to subsemigroups of a free semigroup
- On a question of McNaughton and Papert
- On the construction of comma-free codes
- Cellular automata complexity trade-offs
This page was built for publication: Reducing the local alphabet size in tiling systems by means of 2D comma-free codes
