坚毅
发表于 2025-3-25 03:36:24
Gerald R. Cunha,Laurence Baskin that there is a clopen partition separating two words if and only if the words do not commute. We can decide in quadratic time if the language specified by a DFA is closed, but if the language is specified by an NFA, the problem is PSPACE-complete.
Malfunction
发表于 2025-3-25 09:40:30
http://reply.papertrans.cn/28/2703/270234/270234_22.png
leniency
发表于 2025-3-25 12:45:55
Closures in Formal Languages and Kuratowski’s Theorem that there is a clopen partition separating two words if and only if the words do not commute. We can decide in quadratic time if the language specified by a DFA is closed, but if the language is specified by an NFA, the problem is PSPACE-complete.
不整齐
发表于 2025-3-25 19:34:50
On Stateless Multihead Finite Automata and Multihead Pushdown Automatatter than . heads..We also study stateless multihead pushdown automata in their two-way and one-way, deterministic and nondeterministic variations and show that for all these varieties, . + 1 heads allow more computational power than . heads. Finally, we give some characterizations of stateless multihead finite and multihead pushdown automata.
Campaign
发表于 2025-3-25 22:46:10
http://reply.papertrans.cn/28/2703/270234/270234_25.png
FRAX-tool
发表于 2025-3-26 02:38:53
0302-9743 Overview: 978-3-642-02736-9978-3-642-02737-6Series ISSN 0302-9743 Series E-ISSN 1611-3349
思想流动
发表于 2025-3-26 06:29:50
http://reply.papertrans.cn/28/2703/270234/270234_27.png
Allowance
发表于 2025-3-26 10:15:42
http://reply.papertrans.cn/28/2703/270234/270234_28.png
Rejuvenate
发表于 2025-3-26 15:35:10
Phosphate Control of PTH Secretion{.,.}.. For the subclass of automata whose transition monoids have the property that each regular -class is a subsemigroup, we give a tight bound on lengths of reset words for synchronizing automata thereby answering a question of Volkov.
和平主义
发表于 2025-3-26 17:16:17
Ned J. Place,Stephen E. Glickmanelating them with . words. In particular, some new characterizations of rich words and rich palindromes are given. We also prove that a periodic-like word is rich if and only if the square of its fractional root is also rich.