COMPUTING WHAT A RELATION FAILS TO EXPRESS : KERNEL THEOREMS FOR TRANSITION AUTOMATA(Semigroups, Formal Languages and Combinatorics on Words)

スポンサーリンク

概要

• 論文の詳細を見る
• 京都大学の論文

著者

• NEHANIV Chrystopher

  School of Computer Science & Engineering, University of Aizu

• Nehaniv Chrystopher

  School Of Computer Science And Engineering The University Of Aizu

関連論文

• ALGEBRAIC THEORY OF FINITE AUTOMATA NETWORKS
• COMPUTING WHAT A RELATION FAILS TO EXPRESS : KERNEL THEOREMS FOR TRANSITION AUTOMATA(Semigroups, Formal Languages and Combinatorics on Words)
• ALGEBRA & FORMAL MODELS OF UNDERSTANDING(Semigroups, Formal Languages and Computer Systems)

スポンサーリンク