✦ LIBER ✦

On classes of tractable unrestricted regular expressions

✍ Scribed by Ernst Leiss

Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 966 KB
Volume: 35
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(85)90021-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On some classes of regular matrices

✍ D Rath; B.K Tripathy 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 173 KB

A Tractable and Expressive Class of Marg

A Tractable and Expressive Class of Marginal Contribution Nets and Its Applications

✍ Edith Elkind; Leslie Ann Goldberg; Paul W. Goldberg; Michael Wooldridge 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 171 KB

On algebraic and logical specifications

On algebraic and logical specifications of classes of regular languages

✍ Bakhadyr Khoussainov 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 231 KB

The paper studies classes of regular languages based on algebraic constraints imposed on transitions of automata and discusses issues related to speciÿcations of these classes from algebraic, computational and logical points of view.

A remark on a class of regularizing algo

A remark on a class of regularizing algorithms

✍ A.B. Bakushinskii 📂 Article 📅 1973 🏛 Elsevier Science ⚖ 206 KB

On the construction of a class of regula

On the construction of a class of regular semigroups

✍ T.S Blyth; R McFadden 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 871 KB

On a class of Hamiltonian laceable 3-reg

On a class of Hamiltonian laceable 3-regular graphs

✍ Brian Alspach; C.C. Chen; Kevin McAvaney 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 741 KB

Using the concept of brick-products, Alspach and Zhang showed in that all cubic Cayley graphs over dihedral groups are Hamiltonian. It is also conjectured that all brick-products C(2n, m, r) are Hamiltonian laceable, in the sense that any two vertices at odd distance apart can be joined by a Hamilt