Checking in polynomial time whether or not a regular tree language is deterministic top-down

DOI10.1016/j.ipl.2023.106449arXiv2306.00573OpenAlexW4387167325MaRDI QIDQ6121430

Sebastian Maneth, Helmut Seidl

Publication date: 26 March 2024

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2306.00573

zbMATH Keywords

automatatreesdeterministic top-down

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Simplifying XML schema: single-type approximations of regular tree languages
• Deciding top-down determinism of regular tree languages
• Minimal Ascending and Descending Tree Automata
• Fundamentals of Computation Theory

This page was built for publication: Checking in polynomial time whether or not a regular tree language is deterministic top-down