Recognizable A-tree languages are boolean closed (AIST Programming Science Group technical report = 産業技術総合研究所算譜科学グループ研究速報 ; v.3 no.1)

Recognizable A-tree languages are boolean closed

(AIST Programming Science Group technical report = 産業技術総合研究所算譜科学グループ研究速報 ; v.3 no.1)

Publisher: Informatics Group, Information Technology Research institute, National Institute of Advanced Industrial Science and Technology

You can check the details of this material, its authority (keywords that refer to materials on the same subject, author's name, etc.), etc.

Material Type: 図書
Title: Recognizable A-tree languages are boolean closed
Author/Editor: [by]Hitoshi Ohsaki, Hiroyuki Seki, Toshinori Takai
Series Title: AIST Programming Science Group technical report = 産業技術総合研究所算譜科学グループ研究速報 ; v.3 no.1
Publication, Distribution, etc.: Amagasaki : Informatics Group, Information Technology Research institute, National Institute of Advanced Industrial Science and Technology
Publication Date: 2003.1
Publication Date (W3CDTF): 2003
Extent: 17p
Size: 30cm
Alternative Title: 結合性ツリー言語のブール閉包性ケツゴウセイツリーゲンゴノブールヘイホウセイ
Place of Publication (Country Code): JP
Text Language Code: eng
NDLC: M159
Target Audience: 一般
Holding library: 国立国会図書館
Call No.: M159-B11
Data Provider (Database): 国立国会図書館 : 国立国会図書館蔵書
https://ndlsearch.ndl.go.jp
Bibliographic ID (NDL): 000004024140
http://id.ndl.go.jp/bib/000004024140
National Bibliography No. (JPNO): 20464850
Cataloging Rule: Nippon Cataloguing Rules 1987 Revised Edition
Bibliographic Record Category (NDL): 113