Homomorphic characterization of tree languages based on comma-free encoding
From MaRDI portal
Publication:2232286
DOI10.1007/978-3-030-68195-1_19MaRDI 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
68Q45: Formal languages and automata
Related Items
Reducing local alphabet size in recognizable picture languages, 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
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item