Loops and overloops for tree-walking automata

DOI10.1016/J.TCS.2012.04.026MaRDI QIDQ442148zbMATH OpenOpenAlexFDO

Authors Pierre-Cyrille Héam, Vincent Hugot, Olga Kouchnarenko

Publication date 9 August 2012

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

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

zbMATH Keywords

approximationloopsmembershipemptinessoverloopstree-walking automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Data structures (68P05)

Recommendations

• Loops and overloops for tree walking automata
• scientific article; zbMATH DE number 1670851
• Complementing deterministic tree-walking automata
• Tree-walking-storage automata
• Weighted tree-walking automata
• scientific article
• Tree automata
• Tree-Walking Automata
• scientific article; zbMATH DE number 49206
• Loops in automata and HDTOL relations

Cites work

• scientific article; zbMATH DE number 3254906 (Why is no real title available?)
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Loops and overloops for tree walking automata
• REGAL: A Library to Randomly and Exhaustively Generate Automata
• Random Generation of Deterministic Tree (Walking) Automata
• Semantics of context-free languages
• Transitive closure logic, nested tree walking automata, and XPath
• Translations on a context free grammar
• Tree-Walking Automata
• Tree-walking automata cannot be determinized
• Tree-walking automata do not recognize all regular languages

Cited in

(3)

• scientific article; zbMATH DE number 1670851 (Why is no real title available?)
• Loops and overloops for tree walking automata
• On the power of tree-walking automata.

Describes a project that uses

Uses Software

• REGAL

This page was built for publication: Loops and overloops for tree-walking automata

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