スポンサーリンク
Department of mathematical Sciences, Faculty of Science, Tokai University | 論文
- Finite Mealy-Automata Whose Characteristic Semigroups are Simple
- On the Characteristic Semigroups of Finite QPM-automata
- The Number Tables of the Command Flow Numbers on a Boolean Lattice and a Partition Lattice
- A Tag Type Automaton with a Double Reading Head
- A Class of Recurrence Relations on Acyclic Digraphs of Poset Type (Applied Combinatorial Theory and Algorithms)
- The Number Table of the Coefficients of the Command Flow Polynomial on a Boolean Lattice
- A Necessary and Sufficient Condition for a Simplicial Complex to be an Order Complex and its Checking Computer Algorithm
- A Note on Contractibility of Posets
- Wild Horseshoe and Topological Entropy
- Another Proof of Bela Bollobas' Theorem on Edge Disjoint Cycles