On the disjunctive set problem

DOI10.1016/S0304-3975(98)00034-6zbMath0913.68086MaRDI QIDQ1275463

Václav Koubek, Pavel Goralčík

Publication date: 12 January 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

algorithmcongruencesyntactic monoid

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items (1)

Extremal minimality conditions on automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast algorithms constructing minimal subalgebras, congruences, and ideals in a finite algebra
• On syntacticity of finite regular semigroups
• On the computational power of pushdown automata
• A homomorphism theorem for finite semigroups
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: On the disjunctive set problem