close

VOLUME 30 2025 NUMBERS 1–3
Homomorphic Definitions of Tree Languages via Comma-Free Tree Codes
Stefano Crespi Reghizzi , Pierluigi San Pietro 
Pages 49–76



Download Abstract
 Fulltext is accessible with your personal account
 ShowHide BibTeX
BibTeX: 
@article{JALC-2025-049,
  author  = {},
  title   = {Homomorphic Definitions of Tree Languages via Comma-Free Tree Codes},
  journal = {Journal of Automata, Languages and Combinatorics},
  volume  = {30},
  number  = {1--3},
  pages   = {49--76},
  year    = {2025},
  url     = {https://doi.org/10.25596/jalc-2025-049},
  doi     = {10.25596/jalc-2025-049}
}
If you would like to see an embedded preview, try to select preview as the action for Portable Document Format (PDF) in your brower settings.
Keywords: regular tree languages, strict local testability, Medvedev's theorem, minimal alphabet, comma-free tree codes
DOI: 10.25596/jalc-2025-049