Complementing deterministic tree-walking automata
type: Item
instance of: scholarly article
title: Complementing deterministic tree-walking automata
zbMATH Open document ID: 1184.68324
author: Anca Muscholl
author: Mathias Samuelides
author: Luc Segoufin
published in: Information Processing Letters
publication date: 2010-01-29T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68R05
zbMATH DE Number: 5664454
zbMATH Keywords: combinatorial problems
zbMATH Keywords: formal languages
zbMATH Keywords: tree-automata
MaRDI profile type: Publication
full work available at URL: j.ipl.2005.09.017
OpenAlex ID: W2012346719
cites work: Translations on a context free grammar
cites work: Automata, Languages and Programming
cites work: Tree-walking automata do not recognize all regular languages
cites work: Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure
cites work: Q4941149
cites work: Complexity results for two-way and multi-pebble automata and their logics
cites work: Typechecking for XML transformers
DOI: 10.1016/J.IPL.2005.09.017
Recommended article: Q3077186
Recommended article: Q4884887
Recommended article: Q4274203
Recommended article: Tree-walking-storage automata
Recommended article: Q4993342
Recommended article: Q5418248
Recommended article: Q3323279
Recommended article: Q2754175
Recommended article: On the Determinization of Weighted Finite Automata
Recommended article: Q4995369
description: scientific article; zbMATH DE number 5664454