Loops and overloops for tree-walking automata
type: Item
instance of: scholarly article
title: Loops and overloops for tree-walking automata
zbMATH Open document ID: 1247.68142
author: Pierre-Cyrille Héam
author: Vincent Hugot
author: Olga Kouchnarenko
published in: Theoretical Computer Science
publication date: 2012-08-09T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 6064527
zbMATH Keywords: tree-walking automata
zbMATH Keywords: loops
zbMATH Keywords: overloops
zbMATH Keywords: membership
zbMATH Keywords: emptiness
zbMATH Keywords: approximation
describes a project that uses: REGAL
MaRDI profile type: Publication
full work available at URL: j.tcs.2012.04.026
OpenAlex ID: W3005224781
cites work: Translations on a context free grammar
cites work: Transitive closure logic, nested tree walking automata, and XPath
cites work: Tree-walking automata do not recognize all regular languages
cites work: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
cites work: Tree-walking automata cannot be determinized
cites work: Semantics of context-free languages
cites work: Q5541340
cites work: Tree-Walking Automata
cites work: Random Generation of Deterministic Tree (Walking) Automata
cites work: Loops and Overloops for Tree Walking Automata
cites work: REGAL: A Library to Randomly and Exhaustively Generate Automata
DOI: 10.1016/J.TCS.2012.04.026
Recommended article: Loops and Overloops for Tree Walking Automata
Recommended article: Q2754175
Recommended article: Complementing deterministic tree-walking automata
Recommended article: Tree-walking-storage automata
Recommended article: Q3077186
Recommended article: Q3323279
Recommended article: Q5418248
Recommended article: Tree-Walking Automata
Recommended article: Q3998008
Recommended article: Loops in automata and HDTOL relations
description: scientific article; zbMATH DE number 6064527