The alphabetic complexity in homomorphic definitions of word, tree and picture languages

DOI10.1007/978-3-031-13257-5_1OpenAlexW4300825606MaRDI QIDQ2112173

Stefano Crespi Reghizzi

Publication date: 18 January 2023

Full work available at URL: https://doi.org/10.1007/978-3-031-13257-5_1

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

State complexity of binary coded regular languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Non-expandable non-overlapping sets of pictures
• Reducing local alphabet size in recognizable picture languages
• Classifying regular events in symbolic logic
• Properties of code events and homomorphisms over regular events
• Regular languages as local functions with small alphabets
• Homomorphic characterization of tree languages based on comma-free encoding
• FROM REGULAR TO STRICTLY LOCALLY TESTABLE LANGUAGES
• A decidable characterization of locally testable tree languages
• Comma-Free Codes
• On a question of McNaughton and Papert
• On the construction of comma-free codes

This page was built for publication: The alphabetic complexity in homomorphic definitions of word, tree and picture languages