http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Rise and Fall of Beer Lovers’ Parties in East Central Europe: Party History and General Lessons
Csaba Fazekas 한국외국어대학교(글로벌캠퍼스) 러시아연구소 2021 REGION Vol.10 No.2
This article deals with the process of how beer drinking became a factor in party organization in East Central European politics in the 1990s. It presents historical data on party formation in several nations (Ukraine, Russia, Czecho- slovakia, Poland, and Hungary) as well as campaign activity and results. The characteristics and history of beer lovers’ parties are not simply illustrations of postcommunist party systems. Party organizers saw beer drinking as convey- ing a complex and coherent message that would attract members and follow- ers: friendly beer drinking suggests a peaceful political climate; beer brewing is closely connected to manufacturing, agriculture, and the hospitality industry; it is also a starting point for environmental protection. They found that while beer is indeed a complex symbol, it was not enough to sustain a successful party. And yet an exploration of the theoretical underpinnings of beer parties, and of these parties’ birth and eventual demise, provides valuable insights into both the region and the early postcommunist era.
The power of programmed grammars with graphs from various classes
Madalina Barbaiani,Cristina Bibire,J urgen Dassow,Aidan Delaney,Szilard Fazekas,Mihai Ionescu,Guangwu Liu,Atif Lodhi,Benedek Nagy 한국전산응용수학회 2006 Journal of applied mathematics & informatics Vol.22 No.1-2
Programmed grammars, one of the most important and well investigated classes of grammars with context-free rules and a mechanism controlling the application of the rules, can be described by graphs. We investigate whether or not the restriction to special classes of graphs re- stricts the generative power of programmed grammars with erasing rules and without appearance checking, too. We obtain that Eulerian, Hamil- tonian, planar and bipartite graphs and regular graphs of degree at least three are pr-universal in that sense that any language which can be gener- ated by programmed grammars (with erasing rules and without appearance checking) can be obtained by programmed grammars where the underly- ing graph belongs to the given special class of graphs, whereas complete graphs, regular graphs of degree 2 and backbone graphs lead to proper subfamilies of the family of programmed languages.
THE POWER OF PROGRAMMED GRAMMARS WITH GRAPHS FROM VARIOUS CLASSES
Barbaiani, Madalina,Bibire, Cristina,Dassow, Jurgen,Delaney, Aidan,Fazekas, Szilard,Ionescu, Mihai,Liu, Guangwu,Lodhi, Atif,Nagy, Benedek 한국전산응용수학회 2006 Journal of applied mathematics & informatics Vol.22 No.1
Programmed grammars, one of the most important and well investigated classes of grammars with context-free rules and a mechanism controlling the application of the rules, can be described by graphs. We investigate whether or not the restriction to special classes of graphs restricts the generative power of programmed grammars with erasing rules and without appearance checking, too. We obtain that Eulerian, Hamiltonian, planar and bipartite graphs and regular graphs of degree at least three are pr-universal in that sense that any language which can be generated by programmed grammars (with erasing rules and without appearance checking) can be obtained by programmed grammars where the underlying graph belongs to the given special class of graphs, whereas complete graphs, regular graphs of degree 2 and backbone graphs lead to proper subfamilies of the family of programmed languages.