Modulo-counting quantifiers over finite trees
type: Item
instance of: scholarly article
title: Modulo-counting quantifiers over finite trees
zbMATH Open document ID: 0798.03007
DOI: 10.1016/0304-3975(94)90270-4
author: Andreas Potthoff
published in: Theoretical Computer Science
publication date: 1994-11-03T00:00:00Z
Mathematics Subject Classification ID: 03B15
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 567728
zbMATH Keywords: modulo-counting quantifiers
zbMATH Keywords: logical definability of tree languages
zbMATH Keywords: monadic second-order logic
zbMATH Keywords: first-order logic
MaRDI profile type: Publication
full work available at URL: 0304-3975(94)90270-4
OpenAlex ID: W4213287418
cites work: Weak Second‐Order Arithmetic and Finite Automata
cites work: Tree acceptors and some of their applications
cites work: Q3220545
cites work: An application of games to the completeness problem for formalized theories
cites work: Decision Problems of Finite Automata Design and Related Arithmetics
cites work: Q4179852
cites work: First-order properties of trees, star-free expressions, and aperiodicity
cites work: Q5641083
cites work: A Note on Star-Free Events
cites work: Q4124795
cites work: Q4284261
cites work: Q3949052
cites work: On finite monoids having only trivial subgroups
cites work: Q4431391
cites work: Q3806849
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: Q3221429
description: scientific article; zbMATH DE number 567728