Deterministic top-down tree automata with Boolean deterministic look-ahead

DOI10.1016/J.TCS.2022.05.027OpenAlexW4282014516MaRDI QIDQ2163373

Sándor Vágvölgyi

Publication date: 10 August 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.05.027

zbMATH Keywords

Boolean deterministic tree languagesdeterministic top-down tree languages with Boolean deterministic look-aheaddeterministic top-down tree languages with deterministic top-down look-ahead

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Aural pattern recognition experiments and the subregular hierarchy
• A representation of trees by languages. II
• Top-down tree transducers with deterministic top-down look-ahead
• On Languages Piecewise Testable in the Strict Sense
• Top-down tree transducers with regular look-ahead
• Cognitive and Sub-regular Complexity
• Minimization of Deterministic Top-down Tree Automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Deterministic top-down tree automata with Boolean deterministic look-ahead