On the disjunctive set problem
P. Goralčík,Václav Koubek +1 more
TLDR
This work gives an algorithm solving SYNTACTIC MONOID for a large class of finite monoids in O(¦M¦ 3 ) time and shows that a slight generalization of SYNT ACTICMONOID is NP-complete.About:
This article is published in Theoretical Computer Science.The article was published on 1998-09-01 and is currently open access. It has received 7 citations till now. The article focuses on the topics: Syntactic monoid & Monoid.read more
Citations
More filters
Journal ArticleDOI
Affine Near-Semirings Over Brandt Semigroups
Jitender Kumar,K. V. Krishna +1 more
TL;DR: In this paper, the affine near-semiring over a Brandt semigroup has been studied in terms of the Green's classes of its semigroup reducts and the size of A +(B n ).
Book ChapterDOI
Automata with extremal minimality conditions
Antonio Restivo,Roberto Vaglica +1 more
TL;DR: This paper studies the minimality of a strongly connected DFA by varying the set of final states and considers the complexity of the problem to decide whether an automaton is uniformly minimal or neverminimal.
Book ChapterDOI
Some remarks on automata minimality
Antonio Restivo,Roberto Vaglica +1 more
TL;DR: To what extent minimality depends on the particular subset of final states is investigated, to what extent it depends on both the automata transitions and the set offinal states.
Journal ArticleDOI
Extremal minimality conditions on automata
Antonio Restivo,Roberto Vaglica +1 more
TL;DR: This paper investigates the minimality problem of DFAs by varying the set of final states and seeks to characterize those families of automata and show that some of them are related to well-known objects in a different context.
Book ChapterDOI
Never minimal automata and the rainbow bipartite subgraph problem
Emanuele Rodaro,Pedro V. Silva +1 more
TL;DR: This paper shows that the complement of this problem is equivalent to the problem of checking whether or not in an edge-colored graph there is a bipartite subgraph whose edges are colored using all the colors.
References
More filters
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Book
The Design and Analysis of Computer Algorithms
Alfred V. Aho,John E. Hopcroft +1 more
TL;DR: This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.
Journal ArticleDOI
Depth-First Search and Linear Graph Algorithms
TL;DR: The value of depth-first search or “backtracking” as a technique for solving problems is illustrated by two examples of an improved version of an algorithm for finding the strongly connected components of a directed graph.