scientific article; zbMATH DE number 1136086

MaRDI QIDQ4381397zbMATH OpenFDO

Authors Angelo Monti, Adriano Peron

Publication date 1 April 1998

zbMATH Keywords

Büchi theoremfirst order fragmentlanguages accepted by systolic binary tree automataMcNaughton theoremmonadic second order logicregular languages

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Automata and formal grammars in connection with logical questions (03D05) Formal languages and automata (68Q45)

Recommendations

• Systolic tree \(\omega\)-languages: The operational and the logical view
• A Kleene-like characterization of languages accepted by systolic tree automata
• Logical definability of Y-tree and trellis systolic -languages
• Systolic tree ω-languages
• State complexity of SBTA languages

Cited in

(4)

• A Kleene-like characterization of languages accepted by systolic tree automata
• Succinctness of descriptions of SBTA-languages
• Systolic tree \(\omega\)-languages: The operational and the logical view
• State complexity of SBTA languages

This page was built for publication:

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