Titlebook: Descriptional Complexity of Formal Systems; 15th International W Helmut Jurgensen,Rogério Reis Conference proceedings 2013 Springer-Verlag

ARRAY

書目名稱Descriptional Complexity of Formal Systems影響因子(影響力)




書目名稱Descriptional Complexity of Formal Systems影響因子(影響力)學(xué)科排名




書目名稱Descriptional Complexity of Formal Systems網(wǎng)絡(luò)公開度




書目名稱Descriptional Complexity of Formal Systems網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Descriptional Complexity of Formal Systems被引頻次




書目名稱Descriptional Complexity of Formal Systems被引頻次學(xué)科排名




書目名稱Descriptional Complexity of Formal Systems年度引用




書目名稱Descriptional Complexity of Formal Systems年度引用學(xué)科排名




書目名稱Descriptional Complexity of Formal Systems讀者反饋




書目名稱Descriptional Complexity of Formal Systems讀者反饋學(xué)科排名

LAIR

elucidate

Digest

GOAT

直覺沒有

直覺沒有

Glass Fiber Reinforced Polymers,chagin and Vitányi, we know that sophistication and naive sophistication are equivalent up to low order terms. We use this to relate sophistication to lossy compression, and to derive an alternative formulation for busy beaver computational depth.

Obligatory

State Complexity of ,-Union and ,-Intersection for Prefix-Free Regular Languages,ry alphabet. We prove that the state complexity upper bound for .-union cannot be reached by languages over an alphabet with less than . symbols. We also give a lower bound construction for .-union using a binary alphabet that is within a constant factor of the upper bound.

硬化

Queue Automata of Constant Length,ata paying only by a linear size increase, and that removing nondeterminism in constant length queue automata requires an optimal exponential size blow-up, against the optimal double-exponential cost for determinizing constant height pushdown automata.

水獺