Monoids with finite (regular) complete presentation(Semigroups, Formal Languages and Combinatorics on Words)
スポンサーリンク
概要
著者
関連論文
- On Termination of One-Rule String Rewriting Systems(Semigroups, Formal Languages and Computer Systems)
- Remarks on extractable submonoids (代数系アルゴリズムと言語および計算理論--RIMS研究集会報告集)
- Linear Markov Properties and Undecidability (Algebraic Semigroups, Formal Languages and Computation)
- 有限全変換半群の極大帯とその擬順序
- Monoids with finite (regular) complete presentation(Semigroups, Formal Languages and Combinatorics on Words)
- 有限なelementary codeに付随する置換群について-2-
- 有限なelementary codeに付随する置換群について-1-
- Context-free Languages in $X^+ \backslash Q$(Algebraic Theory of Codes and Related Topics)
- Strongly compatible total orders on free monoids(Algebraic Theory of Codes and Related Topics)
- Maximal avoidable sets of words(Algebraic Theory of Codes and Related Topics)
- 有限全変換半群の極大帯とその擬順序