On the state complexity of partial word DFAs (Q2344741): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
(One intermediate revision by one other user not shown) | |||
Property / DOI | |||
Property / DOI: 10.1016/j.tcs.2015.01.021 / rank | |||
Property / cites work | |||
Property / cites work: Partial Word DFAs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4714446 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Regular languages of partial words / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4055156 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Partial words and a theorem of Fine and Wilf / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algorithmic Combinatorics on Partial Words / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2859380 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3156941 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.TCS.2015.01.021 / rank | |||
Normal rank |
Latest revision as of 02:40, 18 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the state complexity of partial word DFAs |
scientific article |
Statements
On the state complexity of partial word DFAs (English)
0 references
18 May 2015
0 references
automata
0 references
formal languages
0 references
state complexity
0 references
regular languages
0 references
partial languages
0 references
partial words
0 references
deterministic finite automata
0 references
non-deterministic finite automata
0 references