WORD PROBLEMS FOR SEMIGROUPS (Algebras, Languages, Algorithms in Algebraic Systems and Computations)
スポンサーリンク
概要
著者
関連論文
-
WORD PROBLEMS FOR SEMIGROUPS (Algebras, Languages, Algorithms in Algebraic Systems and Computations)
-
Finitely generated semigroups with such a presentation that all the congruence classes are context-free languages (代数系アルゴリズムと言語および計算理論--RIMS研究集会報告集)
-
FINITELY GENERATED SEMIGROUPS WITH REGULAR CONGRUENCE CLASSES(Algebras, Languages, Computations and their Applications)
-
SYNTACTIC MONOIDS AND LANGUAGES (Algebra, Languages and Computation)
-
Note on Holomorphic Foliations with Turbulences on Elliptic Surfaces
-
Finite regular semigroups which are amalgamation bases for finite semigroups (Algebraic Semigroups, Formal Languages and Computation)
-
Finite completely 0-simple semigroups and amalgamation bases for finite semigroups (Languages, Algebra and Computer Systems)
-
Presentation of semigroups and embeddings in inverse semigroups(Semigroups, Formal Languages and Computer Systems)
-
Inverse semigroups and permutation properties(Semigroups, Formal Languages and Combinatorics on Words)
-
CN-帯の表現拡張性
-
右自己移入的かつ右非特異的半群について
-
右自己移入的半群の絶対閉性について
-
ある右簡約的半群の右S-システムとしての移入的包絡について
-
Right Self-Injective Semigroups Are Absolutely Closed (半群とその周辺)
-
グリーン関係が両立的であるような強正則半群について
-
H-両立擬強正則半群について
-
AUTOMATICITY AND PRESENTATIONS OF SEMIGROUPS (Algebras, Languages, Algorithms and Computations)
-
SEMIGROUPS PRESENTED BY FINITE CONGRUENCE CLASSES (Algebraic Systems and Theoretical Computer Science)
もっと見る
閉じる
スポンサーリンク