Reducing local alphabet size in recognizable picture languages

DOI10.1007/978-3-030-81508-0_9MaRDI QIDQ832926zbMATH OpenOpenAlexFDO

Authors Stefano Crespi Reghizzi, Antonio Restivo, Pierluigi San Pietro

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)

Cites work

• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• scientific article; zbMATH DE number 3316963 (Why is no real title available?)
• scientific article; zbMATH DE number 3368555 (Why is no real title available?)
• Codes and automata.
• From regular to strictly locally testable languages
• Homomorphic characterization of tree languages based on comma-free encoding
• Monadic second-order logic over rectangular pictures and recognizability by tiling systems
• Non-expandable non-overlapping sets of pictures

Cited in

(2)

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

This page was built for publication: Reducing local alphabet size in recognizable picture languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832926)