Loops and overloops for tree-walking automata

DOI10.1016/J.TCS.2012.04.026zbMATH Open1247.68142OpenAlexW3005224781MaRDI QIDQ442148FDOQ442148

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

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

zbMATH Keywords

approximationloopsmembershipemptinessoverloopstree-walking automata

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• Title not available (Why is that?)
• On the power of tree-walking automata.
• Loops and overloops for tree walking automata

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)