Subsequence versus substring constraints in sequence pattern languages
type: Item
instance of: scholarly article
title: Subsequence versus substring constraints in sequence pattern languages
author: Steven Engels
author: Tony Tan
author: Jan Van den Bussche
published in: Acta Informatica
publication date: 2021-04-28T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7340918
MaRDI profile type: Publication
full work available at URL: s00236-019-00347-5
OpenAlex ID: W2984588951
cites work: Weak Second‐Order Arithmetic and Finite Automata
cites work: The dot-depth hierarchy of star-free languages is infinite
cites work: Dot-depth of star-free events
cites work: Sequence data mining. Forward by Professor Jiawei Han
cites work: Closure under reversal of languages over infinite alphabets
cites work: Q5472919
cites work: Q5641083
cites work: Finite state machines for strings over infinite alphabets
cites work: The Dot-Depth Hierarchy, 45 Years Later
cites work: On separation by locally testable and locally threshold testable languages
cites work: Automata and Logics for Words and Trees over an Infinite Alphabet
cites work: Q4077455
cites work: On pebble automata for data languages with decidable emptiness problem
cites work: Graph Reachability and Pebble Automata over Infinite Alphabets
cites work: Q3785956
DOI: 10.1007/S00236-019-00347-5
description: scientific article; zbMATH DE number 7340918