A play on regular expressions

DOI10.1145/1863543.1863594zbMath1323.68111OpenAlexW1975501418MaRDI QIDQ5176954

Thomas Wilke, Frank Huch, Sebastian Fischer

Publication date: 5 March 2015

Published in: Proceedings of the 15th ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1863543.1863594

zbMATH Keywords

regular expressionsfinite automataGlushkov constructionpurely functional programming

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Functional programming and lambda calculus (68N18)

Related Items

Derived-Term Automata for Extended Weighted Rational Expressions ⋮ Translating regular expression matching into transducers ⋮ Verified decision procedures for MSO on words based on derivatives of regular expressions ⋮ Automata and rational expressions ⋮ Computing with relational machines

Uses Software

• Haskell

This page was built for publication: A play on regular expressions