Notes on the NP-completeness of the Membership Problem of ET0L LanguagesЕ

2021 ◽  
Author(s):  
Kinga Fogarasi ◽  
Benedek Nagi
Keyword(s):  
Membership Problem ◽  
Np Completeness

scholarly journals NP-Completeness in the gossip monoid

2018 ◽  
Vol 28 (04) ◽  
pp. 653-672 ◽  
Author(s):  
Peter Fenner ◽  
Marianne Johnson ◽  
Mark Kambites
Keyword(s):  
Algebraic Model ◽  
Decision Problems ◽  
Equivalence Relations ◽  
Membership Problem ◽  
Np Completeness ◽  
Important Decision ◽  
Pure Mathematics ◽  
Finite Set ◽  
Np Complete ◽  
Shed Light

Gossip monoids form an algebraic model of networks with exclusive, transient connections in which nodes, when they form a connection, exchange all known information. They also arise naturally in pure mathematics, as the monoids generated by the set of all equivalence relations on a given finite set under relational composition. We prove that a number of important decision problems for these monoids (including the membership problem, and hence the problem of deciding whether a given state of knowledge can arise in a network of the kind under consideration) are NP-complete. As well as being of interest in their own right, these results shed light on the apparent difficulty of establishing the cardinalities of the gossip monoids: a problem which has attracted some attention in the last few years.

scholarly journals NP-completeness and degree restricted spanning trees

1992 ◽  
Vol 105 (1-3) ◽  
pp. 41-47 ◽  
Author(s):  
Robert James Douglas
Keyword(s):  
Spanning Trees ◽  
Np Completeness

The NP-Completeness of Some Edge-Partition Problems

1981 ◽  
Vol 10 (4) ◽  
pp. 713-717 ◽  
Author(s):  
Ian Holyer
Keyword(s):  
Np Completeness ◽  
Edge Partition

ON THE COMPLEXITY OF SCHEDULING WITH COMMUNICATION DELAY AND CONTENTION

1995 ◽  
Vol 05 (03) ◽  
pp. 331-341 ◽  
Author(s):  
MICHAEL G. NORMAN ◽  
SUSANNA PELAGATTI ◽  
PETER THANISCH
Keyword(s):  
Execution Time ◽  
Communication Delay ◽  
Interprocessor Communication ◽  
Communication Latency ◽  
Processor Scheduling ◽  
Np Completeness

We show the NP-Completeness of two processor scheduling with tasks of execution time 1 or 2 units and unit interprocessor communication latency. We develop a model of scheduling in the presence of communication contention, and show the NP-Completeness of two processor scheduling with unit execution time tasks in our model.

scholarly journals Max NP-completeness made easy

1999 ◽  
Vol 225 (1-2) ◽  
pp. 65-79 ◽  
Author(s):  
Pierluigi Crescenzi ◽  
Luca Trevisan
Keyword(s):  
Np Completeness

WHEN CHURCH-ROSSER BECOMES CONTEXT FREE

2007 ◽  
Vol 18 (06) ◽  
pp. 1293-1302 ◽  
Author(s):  
MARTIN KUTRIB ◽  
ANDREAS MALCHER
Keyword(s):  
Linear Time ◽  
Membership Problem ◽  
Closure Properties ◽  
Context Free Language ◽  
Arithmetic Hierarchy ◽  
Context Free ◽  
Free Language

We investigate the intersection of Church-Rosser languages and (strongly) context-free languages. The intersection is still a proper superset of the deterministic context-free languages as well as of their reversals, while its membership problem is solvable in linear time. For the problem whether a given Church-Rosser or context-free language belongs to the intersection we show completeness for the second level of the arithmetic hierarchy. The equivalence of Church-Rosser and context-free languages is Π1-complete. It is proved that all considered intersections are pairwise incomparable. Finally, closure properties under several operations are investigated.

Sign in / Sign up

Export Citation Format

Share Document