Titlebook: STACS 97; 14th Annual Symposiu Rüdiger Reischuk,Michel Morvan Conference proceedings 1997 Springer-Verlag Berlin Heidelberg 1997 Automat.al

Ferret

书目名称STACS 97影响因子(影响力)




书目名称STACS 97影响因子(影响力)学科排名




书目名称STACS 97网络公开度




书目名称STACS 97网络公开度学科排名




书目名称STACS 97被引频次




书目名称STACS 97被引频次学科排名




书目名称STACS 97年度引用




书目名称STACS 97年度引用学科排名




书目名称STACS 97读者反馈




书目名称STACS 97读者反馈学科排名

牢骚

STACS 97978-3-540-68342-1Series ISSN 0302-9743 Series E-ISSN 1611-3349

是剥皮

Reverie

https://doi.org/10.1007/BFb0023443Automat; algorithm; algorithms; automata; complexity; computational geometry; computer science; data struct

LAVE

,Translating regular expressions into small ε-free nondeterministic finite automata,in polynomial time. The best previous conversions result in NFAs of worst case size ..). Moreover, the nonexistence of any linear conversion is proved: we give a language .. described by a regular expression of size .(.) such that every NFA accepting .. is of size . log .).

lattice

不知疲倦

Resource-bounded kolmogorov complexity revisited,a . complexity, a new nondeterministic variant of . complexity..We show several results relating time-bounded . and . complexity and their applications to a variety of questions in computational complexity theory including:

尽责

忘川河

方舟