Classifying regular events in symbolic logic
type: Item
instance of: scholarly article
title: Classifying regular events in symbolic logic
zbMATH Open document ID: 0503.68055
DOI: 10.1016/0022-0000(82)90016-2
author: Wolfgang Thomas
published in: Journal of Computer and System Sciences
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 03D05
zbMATH DE Number: 3793431
zbMATH Keywords: regular languages
zbMATH Keywords: dot-depth hierarchy
zbMATH Keywords: monadic second-order definability
MaRDI profile type: Publication
full work available at URL: 0022-0000(82)90016-2
OpenAlex ID: W2013085432
cites work: The dot-depth hierarchy of star-free languages is infinite
cites work: Characterizations of locally testable events
cites work: Weak Second‐Order Arithmetic and Finite Automata
cites work: Dot-depth of star-free events
cites work: Transition graphs and the star-height of regular events
cites work: An application of games to the completeness problem for formalized theories
cites work: Q4132170
cites work: Decision Problems of Finite Automata Design and Related Arithmetics
cites work: Q5551141
cites work: Q5607956
cites work: Application of model theoretic games to discrete linear orders and finite automata
cites work: Q5641083
cites work: The theory of successor with an extra predicate
description: scientific article; zbMATH DE number 3793431