检索结果-内蒙古大学图书馆

14th International Conference on Membrane Computing, CMC 2013

作者： Gazdag, Zsolt Department of Algorithms and Their Applications Faculty of Informatics Ëotvos Loŕand University Hungary

ISBN: (纸本)9783642542381

In this paper we solve the SAT problem (the satisfiability problem of propositional formulas in conjunctive normal form) by two polynomially uniform families of P systems with active membranes. The novelty of these solutions is that these P systems can solve the SAT problem in linear time in the number of propositional variables occurring in the input. This means that the number of computation steps is independent form the number of clauses of the input. To achieve this efficiency our systems employ only the standard rules of P systems with active membranes plus membrane creation rules. Moreover, in the first solution the P systems do not use the polarizations of the membranes but use such membrane division rules which can change the labels of the involved membranes. In the second solution the P systems do not employ membrane label changing but use the polarizations of the membranes instead. © 2014 Springer-Verlag Berlin Heidelberg.

关键词： Membranes

来源：评论

学校读者我要写书评

暂无评论

On counter machines versus dP automata

On counter machines versus dP automata

引用

14th International Conference on Membrane Computing, CMC 2013

作者： Csuhaj-Varjú, Erzsébet Vaszil, György Department of Algorithms and Their Applications Faculty of Informatics Ëotvos Loŕand University Pazmany Peter setany 1/c 1117 Budapest Hungary Department of Computer Science Faculty of Informatics University of Debrecen P.O. Box 12 4010 Debrecen Hungary

ISBN: (纸本)9783642542381

Continuing the study of connections between classical and P automata variants, we show that dP automata, i.e., distributed systems of P automata, where the input multiset is mapped to the set of strings consisting of all permutations of its elements, are as powerful as the class of distributed systems of special counter machine acceptors. These variants of counter machines read multisets (represented as sets of all permutations of their elements) and manipulate counters in a conventional manner. © 2014 Springer-Verlag Berlin Heidelberg.

关键词： Automata theory

来源：评论

学校读者我要写书评

暂无评论

On the power of permitting features in cooperating context-free array grammar systems

On the power of permitting features in cooperating context-f...

引用

作者： Subramanian, K.G. Venkat, Ibrahim Csuhaj-Varjú, Erzsébet School of Computer Sciences Universiti Sains Malaysia 11800 Penang Malaysia Department of Algorithms and Applications Faculty of Informatics Eötvös Loránd University Budapest Hungary

Among many grammar models for picture description, cooperating context-free distributed array grammar systems utilize the mechanism of cooperation between component array grammars. Here, we endow these grammar systems with the feature of permitting symbols, and examine the generative capacity of the resulting permitting cooperating context-free distributed array grammar systems with certain other kinds of isometric and non-isometric array grammars. An advantage is that the number of components is reduced when this permitting feature is used in a cooperating context-free distributed array grammar system. © 2012 Elsevier B.V. All rights reserved.

关键词： Computational methods

来源：评论

学校读者我要写书评

暂无评论

A new approach for solving SAT by P systems with active membranes

A new approach for solving SAT by P systems with active memb...

引用

13th International Conference on Membrane Computing, CMC 2012

作者： Gazdag, Zsolt Kolonits, Gábor Department of Algorithms and Their Applications Faculty of Informatics Eötvös Loránd University Hungary

ISBN: (纸本)9783642367502

In this paper we give two families of P systems with active membranes that can solve the satisfiability problem of propositional formulas in linear time in the number of propositional variables occurring in the input formula. These solutions do not use polarizations of the membranes or non-elementary membrane division but use separation rules with relabeling. The first solution is a uniform one, but it is not polynomially uniform. The second solution, which is based on the first one, is a polynomially semi-uniform solution. © 2013 Springer-Verlag.

关键词： Membranes

来源：评论

学校读者我要写书评

暂无评论

Ontology-based educational information system

Ontology-based educational information system

引用

IADIS International Conference e-Learning 2012, Part of the IADIS Multi Conference on Computer Science and Information Systems 2012, MCCSIS 2012

作者： Tarcsi, Ádám Nyitrai, Erika Varga, Balázs Department of Media and Educational Informatics Faculty of Informatics Eötvös Loránd University Pazmany Peter setany 1/C H-1117 Budapest Hungary Department of Algorithms And Their Applications Faculty of Informatics Eötvös Loránd University Pazmany Peter setany 1/C H-1117 Budapest Hungary

ISBN: (纸本)9789728939717

The sharpening competition in the education, the lifelong learning and the spreading of e-learning based education require an adaptation and a new way of administration - first of all - from the universities. The prompt provision of the information needed to the more effective operation and decisions requires up to date ERP system and an integrated educational system as well. © 2012 IADIS.

关键词： Semantic Web

来源：评论

学校读者我要写书评

暂无评论

Finite dP automata versus multi-head finite automata

Finite dP automata versus multi-head finite automata

引用

12th International Conference on Membrane Computing, CMC 2011

作者： Csuhaj-Varjú, Erzsébet Vaszil, György Computer and Automation Research Institute Hungarian Academy of Sciences Kende u. 13-17 H-1111 Budapest Hungary Department of Algorithms and Their Applications Faculty of Informatics Eötvös Loránd University Pazmany Peter setany 1/c 1117 Budapest Hungary

ISBN: (纸本)9783642280238

We describe a connection between dP automata (distributed P automata) and non-deterministic multi-head finite automata. We introduce the concepts of agreement languages of dP automata, and the notion of a two-way dP automaton. We demonstrate how the languages of non-deterministic one-way and two-way multi-head finite automata can be obtained as the agreement languages of one-way and two-way finite dP automata. © 2012 Springer-Verlag.

关键词： Finite automata

来源：评论

学校读者我要写书评

暂无评论

P systems controlled by general topologies

P systems controlled by general topologies

引用

11th International Conference on Unconventional Computation and Natural Computation, UCNC 2012

作者： Csuhaj-Varjú, Erzsébet Gheorghe, Marian Stannett, Mike Department of Algorithms and Their Applications Faculty of Informatics Eötvös Loránd University Pázmány Péter st. 1/c Budapest 1117 Hungary Department of Computer Science University of Sheffield Regent Court 211 Portobello Sheffield S1 4DP United Kingdom Department of Computer Science University of Piteşti Str Targu din Vale Piteşti Romania

ISBN: (纸本)9783642328930

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

On the number of components and clusters of non-returning parallel communicating grammar systems

On the number of components and clusters of non-returning pa...

引用

Lecture Notes in Computer Science

作者： Csuhaj-Varjú, Erzsébet Vaszil, György Computer and Automation Research Institute Hungarian Academy of Sciences Kende u. 13-17 Budapest H-1111 Hungary Department of Algorithms and Their Applications Faculty of Informatics Eotvos Lorand University Pazmany Peter setany 1/c 1117 Budapest Hungary

ISBN: (纸本)9783642225994

In this paper, we study the size complexity of non-returning parallel communicating grammar systems. First we consider the problem of determining the minimal number of components necessary to generate all recursively enumerable languages. We present a construction which improves the currently known best bounds of seven (with three predefined clusters) and six (in the non-clustered case) to five, in both cases (having four clusters in the clustered variant). We also show that in the case of unary languages four components are sufficient. Then, by defining systems with dynamical clusters, we investigate the minimal number of different query symbols necessary to obtain computational completeness. We prove that for this purpose three dynamical clusters (which means two different query symbols) are sufficient in general, which (although the number of components is higher) can also be interpreted as an improvement in the number of necessary clusters when compared to the case of predefined clusters. © 2011 Springer-Verlag Berlin Heidelberg.

关键词： Computers

来源：评论

学校读者我要写书评

暂无评论

CD grammar systems: Competence and confidence

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2011年 6610卷 57-69页

作者： Csuhaj-Varjú, Erzsébet Computer and Automation Research Institute Hungarian Academy of Sciences Kende utca 13-17 Budapest 1111 Hungary Department of Algorithms and Their Applications Faculty of Informatics Eötvös Loŕand University Pazmany Peter setany 1/c 1117 Budapest Hungary

ISBN: (纸本)9783642199998

In this paper we introduce cooperating distributed grammar systems with confidence level indication (ciCD grammar systems). These constructs are augmented variants of CD grammar systems where the component grammars indicate their confidence level in rewriting nonterminals. We provide representations of the recursively enumerable language class in terms of ciCD grammar systems with two types of derivations based on the confidence of the components and discuss the relation of some language classes of CD grammar systems with competence-based derivations to language classes of ciCD grammar systems. We also propose topics for future research. © 2011 Springer-Verlag Berlin Heidelberg.

关键词： Computers

来源：评论

学校读者我要写书评

暂无评论

Cooperating distributed grammar systems: Components with nonincreasing competence

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2011年 6610卷 70-89页

作者： Ter Beek, Maurice H. Csuhaj-Varjú, Erzsébet Holzer, Markus Vaszil, György Istituto di Scienza e Tecnologie dell'Informazione 'A. Faedo' Consiglio Nazionale Delle Ricerche Via G. Moruzzi 1 Pisa 56124 Italy Computer and Automation Research Institute Hungarian Academy of Sciences Kende utca 13-17 Budapest 1111 Hungary Institut für Informatik Universität Giessen Arndtstraße 2 Giessen 35392 Germany Department of Algorithms and Their Applications Faculty of Informatics Eötvös Loŕand University Pazmany Peter setany 1/c 1117 Budapest Hungary Institut für Informatik Technische Universität München Boltzmannstraße 3 85748 Garching bei München Germany

ISBN: (纸本)9783642199998

We study the generative power of CD grammar systems (CDGSs) that use a cooperation protocol based on the level of competence on a sentential form - and the competence of their components does not increase during rewriting. A component of a CDGS is k-competent on a sentential form if it can rewrite exactly k different nonterminals appearing in that string. A CDGS with components that are nonincreasing in competence works in =k-competence mode of derivation if no k-competent component can ever become l-competent, for some l∈>∈k. We introduce a static and a dynamic definition to impose this restriction, and we relate the generative power of such CDGSs working either in a sequential or in a parallel manner and according to the aforementioned cooperation protocol, for various k, with that of context-free forbidding random context grammars, (random context) ET0L systems, and context-free programmed grammars with appearance checking. © 2011 Springer-Verlag Berlin Heidelberg.

关键词： Computers

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：