Reducing local alphabet size in recognizable picture languages

DOI10.1007/978-3-030-81508-0_9OpenAlexW3191779799MaRDI QIDQ832926

Antonio Restivo, Pierluigi San Pietro, Stefano Crespi Reghizzi

Publication date: 25 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-81508-0_9

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Reducing the local alphabet size in tiling systems by means of 2D comma-free codes ⋮ The alphabetic complexity in homomorphic definitions of word, tree and picture languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Non-expandable non-overlapping sets of pictures
• Monadic second-order logic over rectangular pictures and recognizability by tiling systems
• Homomorphic characterization of tree languages based on comma-free encoding
• FROM REGULAR TO STRICTLY LOCALLY TESTABLE LANGUAGES