A short history of repetition-free words (Algebras, Languages, Algorithms and Computations)
スポンサーリンク
概要
著者
関連論文
- The derivational complexity of string-rewriting systems (Algebras, Languages, Algorithms in Algebraic Systems and Computations)
- Linear Markov Properties and Undecidability (Algebraic Semigroups, Formal Languages and Computation)
- Grobner bases on projective bimodules and the Hochschild cohomology(IV) : (Co)homology (Languages, Computations, and Algorithms in Algebraic Systems)
- Grobner bases on projective bimodules and the Hochschild cohomology : Part III. Syzygies (Algorithmic and Computational Theory in Algebra and Languages)
- Well-ordered monoids : two numerical functions (Algebraic Systems, Formal Languages and Conventional and Unconventional Computation Theory)
- A bracket representation of the monoid of links (Algebraic Semigroups, Formal Languages and Computation)
- A short history of repetition-free words (Algebras, Languages, Algorithms and Computations)
- Homogenized modular algorithms for Grobner bases (Algebraic Systems and Theoretical Computer Science)
- Correction to "Derivational complexity of string-rewriting systems" (Algebraic Systems and Theoretical Computer Science)
- Some questions on the real numbers (Algebra and Computer Science)