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

ENNUI

热情赞扬

Affirm

拾落穗

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.

积云

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.

职业拳击手

共栖

拥护者

闹剧

烦扰