IEICE Trans

Keyword : formal language

A Note on Pcodes of Partial Words Tetsuo MORIYA Itaru KATAOKA
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2014/01/01 Vol. E97-D No. 1 ; pp. 139-141 Type of Manuscript: LETTER Category: Fundamentals of Information Systems Keyword: formal language, partial word, pcode, compatible,
	Summary \| Full Text:PDF(64.1KB)

d-Primitive Words and Contextual Grammars Tetsuo MORIYA Itaru KATAOKA
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2012/11/01 Vol. E95-D No. 11 ; pp. 2710-2711 Type of Manuscript: LETTER Category: Fundamentals of Information Systems Keyword: formal language, primitive word, non-overlapping word, d-primitive word, context-free, Marcus contextual grammar and language,
	Summary \| Full Text:PDF(58.9KB)

LR Formalisms as Abstract Interpretations of Grammar Semantics Seunghwan O Kwang-Moo CHOE
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2006/12/01 Vol. E89-D No. 12 ; pp. 2924-2932 Type of Manuscript: PAPER Category: Automata and Formal Language Theory Keyword: formal language, LR parsing, formal semantics, abstract interpretation,
	Summary \| Full Text:PDF(310.5KB)

On Computational Power of Insertion-Deletion Systems without Using Contexts Sadaki HIROSE Satoshi OKAWA
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2005/08/01 Vol. E88-D No. 8 ; pp. 1993-1995 Type of Manuscript: LETTER Category: Automata and Formal Language Theory Keyword: Insertion-Deletion system, DNA computing, formal language, automaton,
	Summary \| Full Text:PDF(66.3KB)

Some Relations between Watson-Crick Finite Automata and Chomsky Hierarchy Sadaki HIROSE Kunifumi TSUDA Yasuhiro OGOSHI Haruhiko KIMURA
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2004/05/01 Vol. E87-D No. 5 ; pp. 1261-1264 Type of Manuscript: LETTER Category: Automata and Formal Language Theory Keyword: Watson-Crick automaton, DNA computing, formal language, automaton,
	Summary \| Full Text:PDF(153.2KB)

Tree Automaton with Tree Memory Ryuichi NAKANISHI Izumi HAYAKAWA Hiroyuki SEKI
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1998/02/25 Vol. E81-D No. 2 ; pp. 161-170 Type of Manuscript: PAPER Category: Automata,Languages and Theory of Computing Keyword: tree automaton, tree automaton with tree memory, formal language, natural language, unification-based grammar,
	Summary \| Full Text:PDF(684.6KB)

Eliminating Unnecessary Items from the One-Pass Evaluation of Attribute Grammars Yoshimichi WATANABE Takehiro TOKUDA
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1996/04/25 Vol. E79-D No. 4 ; pp. 312-320 Type of Manuscript: PAPER Category: Software Theory Keyword: attribute grammar, compiler, formal language,
	Summary \| Full Text:PDF(680.1KB)

A Polynomial-Time Recognizable Subclass of Lexical-Functional Grammars Sachiko ANDO Ryuichi NAKANISHI Hiroyuki SEKI Tadao KASAMI
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1994/10/25 Vol. E77-D No. 10 ; pp. 1067-1076 Type of Manuscript: PAPER Category: Automata, Languages and Theory of Computing Keyword: lexical-functional grammar, modified head grammar, formal language, generative capacity,
	Summary \| Full Text:PDF(754.6KB)

A Polynomial Time Learning Algorithm for Recognizable Series Hiroyuki OHNISHI Hiroyuki SEKI Tadao KASAMI
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1994/10/25 Vol. E77-D No. 10 ; pp. 1077-1085 Type of Manuscript: PAPER Category: Automata, Languages and Theory of Computing Keyword: computational learning theory, recognizable series, automata, formal language,
	Summary \| Full Text:PDF(669.2KB)

A Note on Inadequacy of the Model for Learning from Queries Ryuichi NAKANISHI Hiroyuki SEKI Tadao KASAMI
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1994/08/25 Vol. E77-D No. 8 ; pp. 861-868 Type of Manuscript: PAPER Category: Automata, Languages and Theory of Computing Keyword: computational learning theory, learning correctly from queries, formal language, extracting long counter example,
	Summary \| Full Text:PDF(715.1KB)

On the Generative Capacity of Lexical-Functional Grammars Ryuichi NAKANISHI Hiroyuki SEKI Tadao KASAMI
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1992/07/25 Vol. E75-D No. 4 ; pp. 509-516 Type of Manuscript: PAPER Category: Automaton, Language and Theory of Computing Keyword: lexical-functional grammars, formal language, automata, generative capacity,
	Summary \| Full Text:PDF(713.1KB)

The Universal Recognition Problems for Parallel Multiple Context-Free Grammars and for Their Subclasses Yuichi KAJI Ryuichi NAKANISHI Hiroyuki SEKI Tadao KASAMI
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1992/07/25 Vol. E75-D No. 4 ; pp. 499-508 Type of Manuscript: PAPER Category: Automaton, Language and Theory of Computing Keyword: parallel multiple context-free grammars, universal recognition problem, computational complexity, formal language,
	Summary \| Full Text:PDF(810.4KB)

Inductive Inferability for Formal Languages from Positive Data Masako SATO Kazutaka UMAYAHARA
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1992/07/25 Vol. E75-D No. 4 ; pp. 415-419 Type of Manuscript: Special Section PAPER (Special Issue on Algorithmic Learning Theory) Category: Keyword: inductive inference, positive data, formal language,
	Summary \| Full Text:PDF(416KB)

The Universal Recognition Problems for Multiple Context-Free Grammars and for Linear Context-Free Rewriting Systems Yuichi KAJI Ryuichi NAKANISI Hiroyuki SEKI Tadao KASAMI
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1992/01/25 Vol. E75-D No. 1 ; pp. 78-88 Type of Manuscript: Special Section PAPER (Special Section on Theoretical Foundations of Computing) Category: Keyword: multiple context-free grammars, recognition problem, computational complexity, formal language,
	Summary \| Full Text:PDF(881.6KB)