Algorithms for determining the smallest number of nonterminals (states) sufficient for generating (accepting) a regular language R with R1⊆R⊆R2 for given regular languages R1,R2
2015 ◽
Vol 26
(07)
◽
pp. 933-952
◽
Keyword(s):
2006 ◽
Vol 17
(02)
◽
pp. 379-393
◽
2012 ◽
Vol 23
(08)
◽
pp. 1583-1594
Keyword(s):
Keyword(s):
2019 ◽
Vol 29
(9)
◽
pp. 1428-1443
Keyword(s):
2012 ◽
Vol 23
(06)
◽
pp. 1261-1276
◽
Keyword(s):
2021 ◽
pp. 1-27
Keyword(s):
2013 ◽
Vol 24
(07)
◽
pp. 1009-1027
◽
Keyword(s):