Over testable languages
type: Item
instance of: scholarly article
title: Over testable languages
zbMATH Open document ID: 0872.68092
DOI: 10.1016/0304-3975(95)00100-X
author: C. Selmi
published in: Theoretical Computer Science
publication date: 1997-02-27T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 984573
MaRDI profile type: Publication
cites work: The algebra of implicit operations
cites work: Reducibility vs. definability for pseudovarieties of semigroups
cites work: Implicit operations on finite \({\mathcal J}\)-trivial semigroups and a conjecture of I. Simon
cites work: On pseudovarieties, varieties of languages, filters of congruences, pseudoidentities and related topics
cites work: Q3123634
cites work: On the varieties of languages associated with some varieties of finite monoids with commuting idempotents
cites work: Languages and scanners
cites work: Q3680833
cites work: Characterizations of locally testable events
cites work: Q4132170
cites work: On pseudovarieties
cites work: Q4529547
cites work: Algebraic decision procedures for local testability
cites work: Q3776657
cites work: Q3774066
cites work: The Birkhoff theorem for finite algebras
cites work: Q4077455
cites work: Locally testable languages
cites work: Locally testable semigroups
full work available at URL: 0304-3975(95)00100-x
OpenAlex ID: W2044939741
description: scientific article; zbMATH DE number 984573