Two recognizable string-matching problems over free partially commutative monoids
From MaRDI portal
Publication:1190454
DOI10.1016/0304-3975(92)90136-4zbMath0752.68042MaRDI QIDQ1190454
Kosaburo Hashiguchi, Kazuya Yamada
Publication date: 26 September 1992
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(92)90136-4
68Q45: Formal languages and automata
68W10: Parallel algorithms in computer science
20M35: Semigroups in automata theory, linguistics, etc.
Related Items
Efficient special cases of pattern matching with swaps, Two recognizable string-matching problems over free partially commutative monoids
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On some equations in free partially commutative monoids
- On recognizable subsets of free partially commutative monoids
- Recognizable closures and submonoids of free partially commutative monoids
- Two recognizable string-matching problems over free partially commutative monoids
- Combinatorial problems of commutation and rearrangements
- On the computational power of pushdown automata
- Notes on finite asynchronous automata
- Fast Pattern Matching in Strings