The complexity of restricted regular expressions and the synthesis problem for finite automata (Q1052825): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0022-0000(81)90070-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2036210786 / rank | |||
Normal rank | |||
Revision as of 20:24, 19 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
