A note on partially ordered tree automata
type: Item
instance of: scholarly article
title: A note on partially ordered tree automata
zbMATH Open document ID: 1191.68387
published in: Information Processing Letters
publication date: 2010-06-09T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5719190
zbMATH Keywords: formal languages
zbMATH Keywords: formal methods
zbMATH Keywords: tree automata
author: Pierre-Cyrille Héam
describes a project that uses: Timbuk
MaRDI profile type: Publication
full work available at URL: j.ipl.2008.05.012
OpenAlex ID: W1987644139
cites work: Q3774976
cites work: Term Rewriting and Applications
cites work: Permutation rewriting and algorithmic verification
cites work: Q4804924
cites work: Efficiency of automata in semi-commutation verification techniques
cites work: Reachability analysis over term rewriting systems
cites work: On Shuffle Ideals
cites work: Ordering by Divisibility in Abstract Algebras
cites work: Q3659988
cites work: A note on the commutative closure of star-free languages
cites work: Logic, semigroups and automata on words
cites work: Polynomial closure and unambiguous product
cites work: Generalized finite automata theory with an application to a decision problem of second-order logic
cites work: Classifying regular events in symbolic logic
cites work: Q4714446
DOI: 10.1016/J.IPL.2008.05.012
description: scientific article; zbMATH DE number 5719190