障碍 发表于 2025-3-26 22:44:20

Anomalien und Fehlbildungen der Haut,karovitch. Our construction is based on an extension to regular .-expressions of the notion of c-continuation that we introduced to compute the equation automaton of a regular expression as a quotient of its position automaton.

监禁 发表于 2025-3-27 02:55:17

http://reply.papertrans.cn/28/2703/270239/270239_32.png

DOSE 发表于 2025-3-27 09:05:24

Hairpin Finite Automataanguages. Moreover, we show that in most cases we obtain incomparability results for the language families under consideration. Finally, we summarize closure properties of language families accepted by variants of hairpin finite automata.

Lacerate 发表于 2025-3-27 11:04:20

http://reply.papertrans.cn/28/2703/270239/270239_34.png

OVER 发表于 2025-3-27 17:20:37

http://reply.papertrans.cn/28/2703/270239/270239_35.png

减震 发表于 2025-3-27 18:44:01

http://reply.papertrans.cn/28/2703/270239/270239_36.png

拾落穗 发表于 2025-3-28 01:48:04

http://reply.papertrans.cn/28/2703/270239/270239_37.png

荧光 发表于 2025-3-28 04:11:17

http://reply.papertrans.cn/28/2703/270239/270239_38.png

Sputum 发表于 2025-3-28 06:49:33

http://reply.papertrans.cn/28/2703/270239/270239_39.png

圆木可阻碍 发表于 2025-3-28 11:00:33

Hypertrophe Narben und Keloide,te number of regular classes. We give an algorithm for computing this partition. We then investigate maximality conditions in a coding partition and we prove, in the regular case, the equivalence between two different notions of maximality. As an application, we finally derive some new properties of maximal uniquely decipherable codes.
页: 1 2 3 [4] 5 6 7 8
查看完整版本: Titlebook: Developments in Language Theory; 11th International C Tero Harju,Juhani Karhumäki,Arto Lepistö Conference proceedings 2007 Springer-Verlag