THE COMPLEXITY OF REGULAR(-LIKE) EXPRESSIONS (Q2909093): Difference between revisions
From MaRDI portal
Latest revision as of 14:25, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | THE COMPLEXITY OF REGULAR(-LIKE) EXPRESSIONS |
scientific article |
Statements
THE COMPLEXITY OF REGULAR(-LIKE) EXPRESSIONS (English)
0 references
29 August 2012
0 references
regular expressions
0 references
finite automata
0 references
transformations
0 references
descriptional complexity
0 references
computational complexity
0 references
formal language problems
0 references
operation problems
0 references
0 references
0 references
0 references
0 references