Pattern expressions and pattern automata

DOI10.1016/j.ipl.2004.09.007zbMath1173.68546OpenAlexW2082135431MaRDI QIDQ834961

Sheng Yu, Cezar Campeanu

Publication date: 27 August 2009

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

Full work available at URL: https://doi.org/10.1016/j.ipl.2004.09.007

zbMATH Keywords

formal languagesregexpattern expressions

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (8)

Characterising REGEX languages by regular languages equipped with factor-referencing ⋮ The Billaud conjecture for \(|\varSigma| = 4\), and beyond ⋮ Extended regular expressions: succinctness and decidability ⋮ Regular languages with variables on graphs ⋮ Extending regular expressions with homomorphic replacement ⋮ On the closure of pattern expressions languages under intersection with regular languages ⋮ On the intersection of regex languages with regular languages ⋮ INSIDE THE CLASS OF REGEX LANGUAGES

Cites Work

• Minimization algorithms for sequential transducers
• A FORMAL STUDY OF PRACTICAL REGULAR EXPRESSIONS
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Pattern expressions and pattern automata