✦ LIBER ✦

The complexity of restricted regular expressions and the synthesis problem for finite automata

✍ Scribed by Ernst Leiss

Publisher: Elsevier Science
Year: 1981
Tongue: English
Weight: 364 KB
Volume: 23
Category: Article
ISSN: 0022-0000
DOI: 10.1016/0022-0000(81)90070-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The complexity of decision problems for

The complexity of decision problems for finite-turn multicounter machines

✍ Eitan M. Gurari; Oscar H. Ibarra 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 694 KB

Regularity of the boundary data and the

Regularity of the boundary data and the convergence of the finite element discretization in two-phase stefan problems

✍ D. Tiba; M. Tiba 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 620 KB

Tables for the Libration Points of the R

Tables for the Libration Points of the Restricted Problem of Three Bodies

✍ J. E. Rosenthal 📂 Article 📅 1931 🏛 John Wiley and Sons 🌐 English ⚖ 188 KB 👁 2 views

AN EXTENSION OF COMPLEX MODES FOR THE RE

AN EXTENSION OF COMPLEX MODES FOR THE RESOLUTION OF FINITE-ELEMENT POROELASTIC PROBLEMS

✍ O. DAZEL; F. SGARD; C.-H. LAMARQUE; N. ATALLA 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 410 KB

Analysis of the bounded variation and th

Analysis of the bounded variation and the G regularization for nonlinear inverse problems

✍ I. Cimrák 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 191 KB

The complexity of the matching-cut probl

The complexity of the matching-cut problem for planar graphs and other graph classes

✍ Paul Bonsma 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 247 KB

## Abstract The Matching‐Cut problem is the problem to decide whether a graph has an edge cut that is also a matching. Previously this problem was studied under the name of the Decomposable Graph Recognition problem, and proved to be ${\cal{NP}}$‐complete when restricted to graphs with maximum deg