Detecting patterns in finite regular and context-free languages

DOI10.1016/j.ipl.2009.11.002zbMath1206.68181arXiv0906.3220OpenAlexW2056080555MaRDI QIDQ990125

Narad Rampersad, Jeffrey O. Shallit

Publication date: 2 September 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0906.3220

zbMATH Keywords

context-free languageregular languagefinite automatonpattern matchingformal languages

Mathematics Subject Classification ID

Searching and sorting (68P10) Formal languages and automata (68Q45) Pattern recognition, speech recognition (68T10)

Related Items (2)

A Unified Method to Decentralized State Detection and Fault Diagnosis/prediction of Discrete-event Systems ⋮ Factors of generalised polynomials and automatic sequences

Cites Work

• Unnamed Item
• Unnamed Item
• Finding a homomorphism between two words is NP-complete
• Detecting palindromes, patterns and borders in regular languages
• Finding patterns common to a set of strings
• 2726. A problem on strings of beads

This page was built for publication: Detecting patterns in finite regular and context-free languages