Multiple 发表于 2025-3-23 12:36:57

http://reply.papertrans.cn/27/2683/268296/268296_11.png

突袭 发表于 2025-3-23 17:25:56

Małgorzata Oleszkiewicz-PeralbaZemek in 2012 [.]. Second, we close a study started by Černo and Mráz in 2010 [.] by proving that a clearing restarting automaton using contexts of length two can accept a binary non-context-free language.

narcissism 发表于 2025-3-23 19:54:38

http://reply.papertrans.cn/27/2683/268296/268296_13.png

Contend 发表于 2025-3-23 22:40:54

http://reply.papertrans.cn/27/2683/268296/268296_14.png

BARGE 发表于 2025-3-24 04:06:30

http://reply.papertrans.cn/27/2683/268296/268296_15.png

相同 发表于 2025-3-24 07:51:37

http://reply.papertrans.cn/27/2683/268296/268296_16.png

MODE 发表于 2025-3-24 11:21:07

http://reply.papertrans.cn/27/2683/268296/268296_17.png

晚来的提名 发表于 2025-3-24 16:57:02

Affective-Focused Geographical Fieldworkt of infinite words is weakly recognizable by such a morphism if and only if it is accepted by some Büchi automaton. We consider the descriptional complexity of various constructions for weakly recognizing morphisms. This includes the conversion from and to Büchi automata, the conversion into strong

注入 发表于 2025-3-24 19:43:19

http://reply.papertrans.cn/27/2683/268296/268296_19.png

IST 发表于 2025-3-25 00:52:09

http://reply.papertrans.cn/27/2683/268296/268296_20.png
页: 1 [2] 3 4 5 6
查看完整版本: Titlebook: Descriptional Complexity of Formal Systems; 18th IFIP WG 1.2 Int Cezar Câmpeanu,Florin Manea,Jeffrey Shallit Conference proceedings 2016 IF