Titlebook: Algebraic Informatics; Second International Symeon Bozapalidis,George Rahonis Conference proceedings 2007 Springer-Verlag Berlin Heidelberg

只看該作者 · 發(fā)表于 2025-3-29 05:50:46

C.W.J. Oomens,A. Stekelenburg,F. HeuleIn this paper we prove that the set of directed Eulerian graphs is not recognizable. On the other hand, the set of directed graphs with an Eulerian underlying graph is shown to be recognizable. Furthermore, we compute the syntactic complexity of this language and we compare it with that of connected graphs.

只看該作者 · 發(fā)表于 2025-3-29 09:45:00

Ganze algebraische Zahlen (§ 173.)We derive a normal form for linear context-free tree grammars that involves only growing productions. Based on this normal form we then show that all linear context-free tree languages are recognized by restarting tree automata which utilize auxiliary symbols.

只看該作者 · 發(fā)表于 2025-3-29 11:47:50

只看該作者 · 發(fā)表于 2025-3-29 19:34:21

只看該作者 · 發(fā)表于 2025-3-29 21:21:13

只看該作者 · 發(fā)表于 2025-3-30 02:45:14

只看該作者 · 發(fā)表于 2025-3-30 04:12:08

		自動(dòng)登錄	找回密碼
密碼			To register

關(guān)于派博傳思			派博傳思旗下網(wǎng)站			友情鏈接
派博傳思介紹	公司地理位置	論文服務(wù)流程	影響因子官網(wǎng)	吾愛(ài)論文網(wǎng)	大講堂	北京大學(xué)	Oxford Uni.	Harvard Uni.
發(fā)展歷史沿革	期刊點(diǎn)評(píng)	投稿經(jīng)驗(yàn)總結(jié)	SCIENCEGARD	IMPACTFACTOR	派博系數(shù)	清華大學(xué)	Yale Uni.	Stanford Uni.
\|Archiver\|手機(jī)版\|小黑屋\| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-14 16:24
Copyright © 2001-2015 派博傳思京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved