On the language equivalence of NE star-patterns

DOI10.1016/j.ipl.2005.05.003zbMath1185.68395OpenAlexW1979723722MaRDI QIDQ1041796

Benedek Nagy

Publication date: 4 December 2009

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

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

zbMATH Keywords

formal languagespattern languagesextended regexnon-erasing patternstar-pattern

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

On Extended Regular Expressions

Uses Software

• PERL

Cites Work

• Finding patterns common to a set of strings
• Decision problems for patterns
• A FORMAL STUDY OF PRACTICAL REGULAR EXPRESSIONS
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the language equivalence of NE star-patterns