Equivalence of regular expressions over a partially commutative alphabet (Q1040402)
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:
scientific article; zbMATH DE number 5637621
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Equivalence of regular expressions over a partially commutative alphabet |
scientific article; zbMATH DE number 5637621 |
Statements
Equivalence of regular expressions over a partially commutative alphabet (English)
0 references
24 November 2009
0 references
regular expression
0 references
partially commutative alphabet
0 references
automaton
0 references
equivalence
0 references
0.7896308302879333
0 references
0.7867521643638611
0 references
0.7842788696289062
0 references
0.7842788696289062
0 references
0.759816586971283
0 references
