- 2
- 0
- 约4.56万字
- 约 9页
- 2017-05-03 发布于湖北
- 举报
OntheRepresentationofFinite
arXiv:0906.2477v1 [cs.FL] 13 Jun 2009
eeaetoesrns eto hw o hi enumerati their how shows 5 Section strings. those Sectio generate automata. ?nite deterministic not connected th some initially automata introduce ?nite deterministic and for notions representation basic string some review we section,
in a eaalbe o xml,frtsigi w ?nite two represe if the the In automata, testing of canonical. for generation somehow example, (random) for For or th available. objects upon be dependent may and, automata, tions automata ?nite of for representation environments adequate manipulation symbolic In Motivation 1
w minimal two
l DS2 tde h nmrto fdsic agae a languages distinct of fo enumeration relat be the examined with may authors studied survey several [DKS02] A recently, al. More [Rob85] others. Robinson [DKS02]. many see al. amongst particular [Lis69] Liskovets in and 1960s, early since thors
原创力文档

文档评论(0)