The complexity of restricted regular expressions and the synthesis problem for finite automata (Q1052825): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4773298 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5725992 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5590815 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5579037 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Automatic generation of efficient lexical processors using finite state techniques / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5536277 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5586367 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Programming Techniques: Regular expression search algorithm / rank | |||
Normal rank |
Latest revision as of 08:46, 14 June 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