CK828
发表于 2025-3-21 19:24:42
书目名称Developments in Language Theory影响因子(影响力)<br> http://impactfactor.cn/if/?ISSN=BK0270225<br><br> <br><br>书目名称Developments in Language Theory影响因子(影响力)学科排名<br> http://impactfactor.cn/ifr/?ISSN=BK0270225<br><br> <br><br>书目名称Developments in Language Theory网络公开度<br> http://impactfactor.cn/at/?ISSN=BK0270225<br><br> <br><br>书目名称Developments in Language Theory网络公开度学科排名<br> http://impactfactor.cn/atr/?ISSN=BK0270225<br><br> <br><br>书目名称Developments in Language Theory被引频次<br> http://impactfactor.cn/tc/?ISSN=BK0270225<br><br> <br><br>书目名称Developments in Language Theory被引频次学科排名<br> http://impactfactor.cn/tcr/?ISSN=BK0270225<br><br> <br><br>书目名称Developments in Language Theory年度引用<br> http://impactfactor.cn/ii/?ISSN=BK0270225<br><br> <br><br>书目名称Developments in Language Theory年度引用学科排名<br> http://impactfactor.cn/iir/?ISSN=BK0270225<br><br> <br><br>书目名称Developments in Language Theory读者反馈<br> http://impactfactor.cn/5y/?ISSN=BK0270225<br><br> <br><br>书目名称Developments in Language Theory读者反馈学科排名<br> http://impactfactor.cn/5yr/?ISSN=BK0270225<br><br> <br><br>
acrobat
发表于 2025-3-21 22:26:18
J. Holfert,H. Thoms,E. Mylius,K. F. Jordan to intermediately produced strings. We consider semi-simple splicing systems where the axiom set is a regular language, and investigate the descriptional complexity of such systems in terms of the size of the minimal deterministic finite automata that recognize the languages they generate.
LAST
发表于 2025-3-22 01:57:12
Operations on Permutation Automata,dered operations is the same as for regular languages, except for quotients and cut. In case of quotients, it is ., and in case of cut, it is either . or ., depending on whether there exists an integer . with . such that ..
引起痛苦
发表于 2025-3-22 04:55:03
http://reply.papertrans.cn/28/2703/270225/270225_4.png
克制
发表于 2025-3-22 12:12:44
http://reply.papertrans.cn/28/2703/270225/270225_5.png
Cantankerous
发表于 2025-3-22 14:51:04
http://reply.papertrans.cn/28/2703/270225/270225_6.png
Cantankerous
发表于 2025-3-22 20:11:56
http://reply.papertrans.cn/28/2703/270225/270225_7.png
镶嵌细工
发表于 2025-3-23 00:55:08
Conference proceedings 2020 selected from 38 submissions. The papers present current developments in language theory, formal languages, automata theory and related areas, such as algorithmic, combinatorial, and algebraic properties of words and languages, cellular automata, algorithms on words, etc..
OATH
发表于 2025-3-23 03:38:07
Andrea Albers,Jan-Hendrik Hinzkewould imply the existence of deterministic sub-exponential time algorithms for the simulation of nondeterministic linear space bounded computations. This consequence strengthens the existing conditional lower bounds for .-DFA-NEI and implies new non-uniform circuit lower bounds.
Ebct207
发表于 2025-3-23 08:03:54
Das Modell und seine empirische Fundierungalize the result to alphabets of the form . by showing that at most . scattered factors suffices to reconstruct .. Both results improve on the upper bounds known so far. Complexity time bounds on reconstruction algorithms are also considered here.