Subsequence versus substring constraints in sequence pattern languages

DOI10.1007/s00236-019-00347-5OpenAlexW2984588951MaRDI QIDQ2022305

Tony Tan, Jan Van den Bussche, Steven Engels

Publication date: 28 April 2021

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-019-00347-5

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The dot-depth hierarchy of star-free languages is infinite
• Closure under reversal of languages over infinite alphabets
• On pebble automata for data languages with decidable emptiness problem
• Dot-depth of star-free events
• Sequence data mining. Forward by Professor Jiawei Han
• On Separation by Locally Testable and Locally Threshold Testable Languages
• Graph Reachability and Pebble Automata over Infinite Alphabets
• Weak Second‐Order Arithmetic and Finite Automata
• Automata and Logics for Words and Trees over an Infinite Alphabet
• The Dot-Depth Hierarchy, 45 Years Later
• Finite state machines for strings over infinite alphabets

This page was built for publication: Subsequence versus substring constraints in sequence pattern languages