✦ LIBER ✦

Equivalence problem of non-deterministic finite automata

✍ Scribed by A. Nozaki

Publisher: Elsevier Science
Year: 1979
Tongue: English
Weight: 511 KB
Volume: 18
Category: Article
ISSN: 0022-0000
DOI: 10.1016/0022-0000(79)90048-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On path equivalence of nondeterministic

On path equivalence of nondeterministic finite automata

✍ Tzeng Wen-Guey 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 384 KB

Equivalence, reduction and minimization

Equivalence, reduction and minimization of finite fuzzy-automata

✍ Vladimir V Topencharov; Ketty G Peeva 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 491 KB

The decidability of equivalence for dete

The decidability of equivalence for deterministic finite transducers

✍ Meera Blattner; Tom Head 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 294 KB

Decidability for some problems of linear

Decidability for some problems of linear cellular automata over finite commutative rings

✍ Tadakazu Sato 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 409 KB

The complexity of restricted regular exp

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

✍ Ernst Leiss 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 364 KB

Equivalent Blocks of Finite General Line

Equivalent Blocks of Finite General Linear Groups in Non-describing Characteristic

✍ W. Turner 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 182 KB

Rickard have proved Broué's Abelian defect group conjecture for many symmetric groups. We adapt the ideas of Kessar and Chuang towards finite general linear groups (represented over non-describing characteristic). We then describe Morita equivalences between certain p-blocks of GL n q with defect gr