Systolic tree ω-languages

DOI10.1007/3-540-59042-0_68MaRDI QIDQ4596616zbMATH OpenOpenAlexFDO

Authors Angelo Monti, Adriano Peron

Publication date 4 December 2017

Published in STACS 95 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-59042-0_68

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Systolic tree \(\omega\)-languages: The operational and the logical view
• On a family of L languages resulting from systolic tree automata
• Logical definability of Y-tree and trellis systolic -languages
• Infinitary tree languages recognized by \(\omega\)-automata
• A Kleene-like characterization of languages accepted by systolic tree automata
• Syntactic monoids in the construction of systolic tree automata
• Systolic tree and tree-like automata
• scientific article; zbMATH DE number 4030987
• Languages accepted by systolic \(Y\)-tree automata: Structural characterizations
• On syntactic congruences for \(\omega\)-languages

Cited in

(7)

• The greatest fixed-points and rational omega-tree languages
• Systolic tree \(\omega\)-languages: The operational and the logical view
• Logical definability of Y-tree and trellis systolic -languages
• Syntactic monoids in the construction of systolic tree automata
• scientific article; zbMATH DE number 1136086 (Why is no real title available?)
• Infinitary tree languages recognized by \(\omega\)-automata
• On a family of L languages resulting from systolic tree automata

This page was built for publication: Systolic tree ω-languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4596616)