Regular Sets and Expressions (Q7361044)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
AFP entry Regular-Sets
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Regular Sets and Expressions |
AFP entry Regular-Sets |
Statements
12 May 2010
0 references
Alexander Krauss
0 references
Tobias Nipkow
0 references
Manuel Eberl
0 references
Christian Urban
0 references
Regular Sets and Expressions (English)
0 references
This is a library of constructions on regular expressions and languages. It provides the operations of concatenation, Kleene star and derivative on languages. Regular expressions and their meaning are defined. An executable equivalence checker for regular expressions is verified; it does not need automata but works directly on regular expressions. By mapping regular expressions to binary relations, an automatic and complete proof method for (in)equalities of binary relations over union, concatenation and (reflexive) transitive closure is obtained. Extended regular expressions with complement and intersection are also defined and an equivalence checker is provided.
0 references
