On Extended Regular Expressions

DOI10.1007/978-3-642-00982-2_24zbMath1234.68202OpenAlexW1546515396MaRDI QIDQ3618588

Benjamin Carle, Paliath Narendran

Publication date: 2 April 2009

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00982-2_24

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (9)

Characterising REGEX languages by regular languages equipped with factor-referencing ⋮ Extended regular expressions: succinctness and decidability ⋮ On the undecidability and descriptional complexity of synchronized regular expressions ⋮ Re-examining regular expressions with backreferences ⋮ Document Spanners ⋮ On Extended Regular Expressions ⋮ Deterministic regular expressions with back-references ⋮ A logic for document spanners ⋮ Annotated regular expressions and input-driven languages

Uses Software

• PERL

Cites Work

• Unnamed Item
• Unnamed Item
• Multi-pattern languages
• On the language equivalence of NE star-patterns
• Decision problems for patterns
• Finite turns and the regular closure of linear context-free languages
• On Extended Regular Expressions
• Regular Closure of Deterministic Languages
• A FORMAL STUDY OF PRACTICAL REGULAR EXPRESSIONS

This page was built for publication: On Extended Regular Expressions