From Finite Automata to Regular Expressions and Back — A Summary on Descriptional Complexity (Q2800411)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | From Finite Automata to Regular Expressions and Back — A Summary on Descriptional Complexity |
scientific article |
Statements
From Finite Automata to Regular Expressions and Back — A Summary on Descriptional Complexity (English)
0 references
15 April 2016
0 references
finite automata
0 references
regular expressions
0 references
descriptional complexity
0 references
upper bounds
0 references
lower bounds
0 references
0 references
0 references
0 references
0 references
0 references
0 references
