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

DOI10.1016/J.TCS.2022.05.027OpenAlexW4282014516MaRDI QIDQ2163373FDOQ2163373

Authors: 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

Recommendations

• scientific article; zbMATH DE number 17541
• Top-down tree transducers with deterministic top-down look-ahead
• Deterministic top-down tree transducers with iterated look-ahead
• Linear deterministic multi bottom-up tree transducers
• Top-down tree transducers with two-way tree walking look-ahead

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

• Top-down tree transducers with regular look-ahead
• Title not available (Why is that?)
• Title not available (Why is that?)
• Deterministic top-down tree automata: past, present, and future
• Aural pattern recognition experiments and the subregular hierarchy
• Top-down tree transducers with deterministic top-down look-ahead
• A representation of trees by languages. II
• On languages piecewise testable in the strict sense
• Cognitive and sub-regular complexity
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Minimization of deterministic top-down tree automata

Cited In (2)

• Top-down tree transducers with two-way tree walking look-ahead
• Title not available (Why is that?)

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

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