2013/01/15 by Jean-Marc Champarnaud, Champarnaud, Jean-Marc, Jean-Philippe Dubernard +5
Biochemistry, Genetics and Molecular Biology · Computer Science · #68Q45 #Algorithms and Data Compression #DNA and Biological Computing #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Formal Methods in Verification #Logic, programming, and type systems #cs.FL #msc:68Q45 #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1301.3316
28 pages
arxiv created 2013/01/15 · openalex publication_date 2013/01/15 · arxiv updated 2013/01/16 · openalex created_date 2025/10/24 · openalex updated_date 2026/07/28
The aim of this paper is to design the polynomial construction of a finite recognizer for hairpin completions of regular languages. This is achieved by considering completions as new expression operators and by applying derivation techniques to the associated extended expressions called hairpin expressions. More precisely, we extend partial derivation of regular expressions to two-sided partial derivation of hairpin expressions and we show how to deduce a recognizer for a hairpin expression from its two-sided derived term automaton, providing an alternative proof of the fact that hairpin completions of regular languages are linear context-free.