Homomorphic characterization of tree languages based on comma-free encoding

DOI10.1007/978-3-030-68195-1_19OpenAlexW3132939114MaRDI QIDQ2232286

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)

Related Items (3)

Reducing local alphabet size in recognizable picture languages ⋮ 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
• Two-dimensional comma-free and cylindric codes
• Classifying regular events in symbolic logic
• Hall sets, Lazard sets and comma-free codes
• FROM REGULAR TO STRICTLY LOCALLY TESTABLE LANGUAGES
• A decidable characterization of locally testable tree languages
• Noncounting Context-Free Languages

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