String matching problems over free partially commutative monoids
type: Item
instance of: scholarly article
title: String matching problems over free partially commutative monoids
zbMATH Open document ID: 0769.68063
DOI: 10.1016/0890-5401(92)90060-S
author: Kosaburo Hashiguchi
author: Kazuya Yamada
published in: Information and Computation
publication date: 1993-05-16T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 20M35
zbMATH DE Number: 165614
zbMATH Keywords: string matching
zbMATH Keywords: free partially commutative monoids
zbMATH Keywords: efficient polynomial time algorithms
MaRDI profile type: Publication
cites work: Q4091421
cites work: Optimal off-line detection of repetitions in a string
cites work: Q3741074
cites work: Combinatorial problems of commutation and rearrangements
cites work: Recognizable subsets of some partially Abelian monoids
cites work: Q3736919
cites work: Q3673134
cites work: Q3692898
cites work: On some equations in free partially commutative monoids
cites work: Q3954801
cites work: On the decidability of some problems about rational subsets of free partially commutative monoids
cites work: String overlaps, pattern matching, and nontransitive games
cites work: Recognizable closures and submonoids of free partially commutative monoids
cites work: Fast Pattern Matching in Strings
cites work: On recognizable subsets of free partially commutative monoids
cites work: Une condition suffisante de reconnaissabilité dans un monoïde partiellement commutatif
cites work: Q3738586
cites work: Programming Techniques: Regular expression search algorithm
cites work: Notes on finite asynchronous automata
full work available at URL: 0890-5401(92)90060-s
OpenAlex ID: W2069104328
description: scientific article; zbMATH DE number 165614