The complexity of restricted regular expressions and the synthesis problem for finite automata (Q1052825): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 03:02, 5 March 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
