Revision as of 09:20, 26 March 2017 edit TheoreticalComputerScientist (talk \| contribs) 149 edits m →Transformation between variants of finite automata: Changed the link to Ladner, about to create his page ← Previous edit		Revision as of 09:38, 29 March 2017 edit undo Hosmich (talk \| contribs) 459 edits m NFA intersection is mn Next edit →
Line 150: * DFA: <math>mn</math> states, see Maslov<ref name="Maslov" /> and Yu, Zhuang and Salomaa.<ref name="YuZhuang1994" /> * NFA: <math>~~m+n+1~~mn</math> states, see Holzer and Kutrib.<ref name="HolzerKutrib2003" /> * UFA: <math>mn</math> states, see Jirásek, Jirásková and Šebej.<ref name="JirásekJirásková2016" /> * SVFA: <math>mn</math> states, see Jirásek, Jirásková and Szabari.<ref name="JirásekJirásková2015" />

State complexity: Difference between revisions