The complexity of restricted regular expressions and the synthesis problem for finite automata (Q1052825): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q386048 |
||
| Property / author | |||
| Property / author: Ernst L. Leiss / rank | |||
Revision as of 04:38, 14 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of restricted regular expressions and the synthesis problem for finite automata |
scientific article |
Statements
The complexity of restricted regular expressions and the synthesis problem for finite automata (English)
0 references
1981
0 references
regular expression
0 references
deterministic finite automaton
0 references
