Titlebook: Automata, Languages and Programming; 29th International C Peter Widmayer,Stephan Eidenbenz,Matthew Hennessy Conference proceedings 2002 Spr

mobility

書目名稱Automata, Languages and Programming影響因子(影響力)




書目名稱Automata, Languages and Programming影響因子(影響力)學(xué)科排名




書目名稱Automata, Languages and Programming網(wǎng)絡(luò)公開度




書目名稱Automata, Languages and Programming網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Automata, Languages and Programming被引頻次




書目名稱Automata, Languages and Programming被引頻次學(xué)科排名




書目名稱Automata, Languages and Programming年度引用




書目名稱Automata, Languages and Programming年度引用學(xué)科排名




書目名稱Automata, Languages and Programming讀者反饋




書目名稱Automata, Languages and Programming讀者反饋學(xué)科排名

切割

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/b/image/166194.jpg

羊欄

Gesundheitsberichterstattung in DeutschlandThe notion of . in mathematical structures is a powerful tool in many branches of mathematics. The talk presents an application of this notion to programming language theory.

忘恩負(fù)義的人

U. Laaser,P. Wolters,F. X. KaufmannIn this paper we consider the intersection-nonemptiness problem for languages given by regular expression without binary +. We prove that for regular expressions of star height 2 this problem is .-complete and it is .-complete for regular expressions of star height at most 1.

irritation

薄荷醇

Equivariant Syntax and SemanticsThe notion of . in mathematical structures is a powerful tool in many branches of mathematics. The talk presents an application of this notion to programming language theory.

AGATE

Intersection of Regular Languages and Star HierarchyIn this paper we consider the intersection-nonemptiness problem for languages given by regular expression without binary +. We prove that for regular expressions of star height 2 this problem is .-complete and it is .-complete for regular expressions of star height at most 1.

聰明

Fecal-Impaction

bile648

Local and Global Methods in Data Mining: Basic Techniques and Open ProblemsData mining research can be divided into global approaches, which try to model the whole data, and local methods, which try to find useful patterns occurring in the data. We discuss briefly some simple local and global techniques, review two attempts at combining the approaches, and list open problems with an algorithmic flavor.