The complexity of restricted regular expressions and the synthesis problem for finite automata (Q1052825)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The complexity of restricted regular expressions and the synthesis problem for finite automata |
scientific article; zbMATH DE number 3817054
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of restricted regular expressions and the synthesis problem for finite automata |
scientific article; zbMATH DE number 3817054 |
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
