Families of locally testable languages
type: Item
instance of: scholarly article
title: Families of locally testable languages
zbMATH Open document ID: 0944.68097
DOI: 10.1016/S0304-3975(98)00332-6
author: Pascal Caron
published in: Theoretical Computer Science
publication date: 2000-08-21T00:00:00Z
Mathematics Subject Classification ID: 68R15
Mathematics Subject Classification ID: 20M05
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1493366
zbMATH Keywords: algorithms
zbMATH Keywords: automata
zbMATH Keywords: locally testable languages
zbMATH Keywords: regular languages
describes a project that uses: AG
describes a project that uses: LANGAGE
MaRDI profile type: Publication
cites work: Codes circulaires, automates locaux et entropie
cites work: Languages and scanners
cites work: Local languages and the Berry-Sethi algorithm
cites work: Characterizations of locally testable events
cites work: Q3862379
cites work: A polynomial time algorithm for the local testability problem of deterministic finite automata
cites work: Q3853827
cites work: A characterization of strictly locally testable languages and its application to subsemigroups of a free semigroup
cites work: Algebraic decision procedures for local testability
cites work: Q5641083
cites work: Transductions des langages de Chomsky
cites work: Q4385527
cites work: Q3776657
cites work: Q4132760
cites work: Locally testable languages
Wikidata QID: Q127740389
description: scientific article; zbMATH DE number 1493366