From finite automata to regular expressions and back -- a summary on descriptional complexity (Q4994933)
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 7361953
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | From finite automata to regular expressions and back -- a summary on descriptional complexity |
scientific article; zbMATH DE number 7361953 |
Statements
22 June 2021
0 references
0.9917615652084352
0 references
0.844605028629303
0 references
0.843261182308197
0 references
0.8393685221672058
0 references
