Algebras for classifying regular tree languages and an application to frontier testability
From MaRDI portal
Publication:4630273
DOI10.1007/3-540-56939-1_85zbMath1422.68165OpenAlexW1575009210MaRDI QIDQ4630273
Publication date: 29 March 2019
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-56939-1_85
Related Items (3)
An algebraic characterization of frontier testable tree languages ⋮ Recognisability for algebras of infinite trees ⋮ General varieties of tree languages
Cites Work
This page was built for publication: Algebras for classifying regular tree languages and an application to frontier testability