Regular expression containment

DOI10.1145/1926385.1926429zbMath1284.68353OpenAlexW4230275554MaRDI QIDQ5408558

Lasse R. Nielsen, Fritz Henglein

Publication date: 10 April 2014

Published in: Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

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

zbMATH Keywords

equivalencetypeaxiomatizationcoinductioncontainmentcoercionregular expressioncomputational interpretation

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic in computer science (03B70)

Related Items

A Computational Interpretation of Context-Free Expressions ⋮ A Coinductive Reformulation of Milner's Proof System for Regular Expressions Modulo Bisimilarity ⋮ Proving language inclusion and equivalence by coinduction ⋮ Translating regular expression matching into transducers ⋮ Simple linear string constraints ⋮ Unnamed Item

This page was built for publication: Regular expression containment