Sequentiality, monadic second-order logic and tree automata.
type: Item
instance of: scholarly article
title: Sequentiality, monadic second-order logic and tree automata.
zbMATH Open document ID: 1051.68086
author: Hubert Comon
published in: Information and Computation
publication date: 2003-01-14T00:00:00Z
Mathematics Subject Classification ID: 68Q42
Mathematics Subject Classification ID: 03B15
Mathematics Subject Classification ID: 03C85
Mathematics Subject Classification ID: 03D05
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1853092
zbMATH Keywords: term rewriting system
MaRDI profile type: Publication
full work available at URL: inco.1999.2838
OpenAlex ID: W2011805144
cites work: Q4537513
cites work: Equality and disequality constraints on direct subterms in tree automata
cites work: Encompassment properties and automata with constraints
cites work: Equational formulae with membership constraints
cites work: Q4385532
cites work: Q3323279
cites work: Q4297316
cites work: Sequential evaluation strategies for parallel-or and related reduction systems
cites work: Sequentiality in orthogonal term rewriting systems
cites work: Q4705608
cites work: Computing in systems described by equations
cites work: NV-Sequentiality: A Decidable Condition for Call-by-Need Computations in Term-Rewriting Systems
cites work: Decidability of Second-Order Theories and Automata on Infinite Trees
cites work: Deciding Equivalence of Finite Tree Automata
cites work: Programming in equational logic: Beyond strong sequentiality
cites work: Generalized finite automata theory with an application to a decision problem of second-order logic
cites work: Q4385530
DOI: 10.1006/INCO.1999.2838
description: scientific article; zbMATH DE number 1853092