Access count of this item: 141

Files in This Item:
File Description SizeFormat 
0910-10.pdf786.88 kBAdobe PDFView/Open
Title: COMPUTING WHAT A RELATION FAILS TO EXPRESS : KERNEL THEOREMS FOR TRANSITION AUTOMATA(Semigroups, Formal Languages and Combinatorics on Words)
Authors: NEHANIV, CHRYSTOPHER L.
Issue Date: May-1995
Publisher: 京都大学数理解析研究所
Journal title: 数理解析研究所講究録
Volume: 910
Start page: 60
End page: 66
URI: http://hdl.handle.net/2433/59537
Appears in Collections:Semigroups, Formal Languages and Combinatorics on Words

Show full item record

Export to RefWorks


Export Format: 


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.