Regular expressions with nested levels of back referencing form a hierarchy

DOI10.1016/S0020-0190(98)00007-6MaRDI QIDQ293228zbMATH OpenFDO

Authors Kim S. Larsen

Publication date 9 June 2016

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

Full work available at URL http://www.sciencedirect.com/science/article/pii/S0020019098000076?np=y

zbMATH Keywords

back referencingformal languagesregular expressions

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Deterministic regular expressions with back-references
• Inside the class of REGEX languages
• Inside the Class of REGEX Languages
• Deterministic regular expressions with back-references
• Extended Regular Expressions: Succinctness and Decidability

Cites work

• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• The lambda calculus, its syntax and semantics

Cited in

(5)

• Re-examining regular expressions with backreferences
• Extended regular expressions: succinctness and decidability
• Regular languages with variables on graphs
• Deterministic regular expressions with back-references
• Measuring the expressive power of practical regular expressions by classical stacking automata models

This page was built for publication: Regular expressions with nested levels of back referencing form a hierarchy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293228)