commotion
发表于 2025-3-21 16:17:47
书目名称Developments in Language Theory影响因子(影响力)<br> http://figure.impactfactor.cn/if/?ISSN=BK0270233<br><br> <br><br>书目名称Developments in Language Theory影响因子(影响力)学科排名<br> http://figure.impactfactor.cn/ifr/?ISSN=BK0270233<br><br> <br><br>书目名称Developments in Language Theory网络公开度<br> http://figure.impactfactor.cn/at/?ISSN=BK0270233<br><br> <br><br>书目名称Developments in Language Theory网络公开度学科排名<br> http://figure.impactfactor.cn/atr/?ISSN=BK0270233<br><br> <br><br>书目名称Developments in Language Theory被引频次<br> http://figure.impactfactor.cn/tc/?ISSN=BK0270233<br><br> <br><br>书目名称Developments in Language Theory被引频次学科排名<br> http://figure.impactfactor.cn/tcr/?ISSN=BK0270233<br><br> <br><br>书目名称Developments in Language Theory年度引用<br> http://figure.impactfactor.cn/ii/?ISSN=BK0270233<br><br> <br><br>书目名称Developments in Language Theory年度引用学科排名<br> http://figure.impactfactor.cn/iir/?ISSN=BK0270233<br><br> <br><br>书目名称Developments in Language Theory读者反馈<br> http://figure.impactfactor.cn/5y/?ISSN=BK0270233<br><br> <br><br>书目名称Developments in Language Theory读者反馈学科排名<br> http://figure.impactfactor.cn/5yr/?ISSN=BK0270233<br><br> <br><br>
Heart-Rate
发表于 2025-3-21 21:16:20
Undecidability and Finite AutomataUsing a novel rewriting problem, we show that several natural decision problems about finite automata are undecidable (i.e., recursively unsolvable). In contrast, we also prove three related problems are decidable. We apply one result to prove the undecidability of a related problem about .-automatic sets of rational numbers.
ACTIN
发表于 2025-3-22 00:53:14
Émilie Charlier,Julien Leroy,Michel RigoIncludes supplementary material:
过分
发表于 2025-3-22 05:14:31
http://reply.papertrans.cn/28/2703/270233/270233_4.png
确保
发表于 2025-3-22 10:35:20
http://reply.papertrans.cn/28/2703/270233/270233_5.png
Supplement
发表于 2025-3-22 12:53:29
978-3-319-62808-0Springer International Publishing AG 2017
Supplement
发表于 2025-3-22 20:34:06
Kontext und Wirkung von Suggestionene classical results on two-player zero-sum games and then on multi-player non zero-sum games. The simple case of one-player games is strongly related to automata theory on infinite words. All along the article, we focus on general approaches to solve the studied problems, and we provide several illu
ectropion
发表于 2025-3-23 00:08:05
http://reply.papertrans.cn/28/2703/270233/270233_8.png
祖传财产
发表于 2025-3-23 01:44:16
Indirekte Induktion und Kommunikationntations of integers. We discuss many results expressing the number of binomial coefficients . with a given .-adic valuation in terms of the number of occurrences of a given word in the base-. representation of ., beginning with a result of Glaisher from 1899, up through recent results by Spiegelhof
缩影
发表于 2025-3-23 06:54:26
http://reply.papertrans.cn/28/2703/270233/270233_10.png