Homomorphic characterization of tree languages based on comma-free encoding

DOI10.1007/978-3-030-68195-1_19MaRDI QIDQ2232286zbMATH OpenOpenAlexFDO

Authors Stefano Crespi Reghizzi, Pierluigi San Pietro

Publication date 4 October 2021

Full work available at URL https://doi.org/10.1007/978-3-030-68195-1_19

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• A decidable characterization of locally testable tree languages
• Classifying regular events in symbolic logic
• Codes and automata.
• From regular to strictly locally testable languages
• Hall sets, Lazard sets and comma-free codes
• 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?)
• Noncounting Context-Free Languages
• Two-dimensional comma-free and cylindric codes

Cited in

(6)

• 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
• Regular languages as images of local functions over small alphabets
• Homomorphic definitions of tree languages via comma-free tree codes
• Tiling of toroidal arrays with pictures: uniqueness, shift-equivalence and undecidability
• Reducing local alphabet size in recognizable picture languages

This page was built for publication: Homomorphic characterization of tree languages based on comma-free encoding

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