首页
学术期刊
论文检测
AIGC检测
热点
更多
数据
COVERING OF PARSABLE GRAMMARS
被引:3
|
作者
:
NIJHOLT, A
论文数:
0
引用数:
0
h-index:
0
机构:
TWENTE UNIV TECHNOL,DEPT APPL MATH,ENSCHEDE,NETHERLANDS
TWENTE UNIV TECHNOL,DEPT APPL MATH,ENSCHEDE,NETHERLANDS
NIJHOLT, A
[
1
]
机构
:
[1]
TWENTE UNIV TECHNOL,DEPT APPL MATH,ENSCHEDE,NETHERLANDS
来源
:
JOURNAL OF COMPUTER AND SYSTEM SCIENCES
|
1977年
/ 15卷
/ 01期
关键词
:
D O I
:
10.1016/S0022-0000(77)80027-5
中图分类号
:
TP3 [计算技术、计算机技术];
学科分类号
:
0812 ;
摘要
:
引用
收藏
页码:99 / 110
页数:12
相关论文
共 50 条
[1]
Polynomially parsable unification grammars
Peled, Hadas
论文数:
0
引用数:
0
h-index:
0
机构:
Univ Haifa, Dept Comp Sci, IL-31905 Haifa, Israel
Univ Haifa, Dept Comp Sci, IL-31905 Haifa, Israel
Peled, Hadas
Wintner, Shuly
论文数:
0
引用数:
0
h-index:
0
机构:
Univ Haifa, Dept Comp Sci, IL-31905 Haifa, Israel
Univ Haifa, Dept Comp Sci, IL-31905 Haifa, Israel
Wintner, Shuly
JOURNAL OF LOGIC AND COMPUTATION,
2015,
25
(05)
: 1167
-
1202
[2]
BOUNDED CONTEXT PARSABLE GRAMMARS
WILLIAMS, JH
论文数:
0
引用数:
0
h-index:
0
机构:
CORNELL UNIV,COMP SCI DEPT,ITHACA,NY 14850
CORNELL UNIV,COMP SCI DEPT,ITHACA,NY 14850
WILLIAMS, JH
INFORMATION AND CONTROL,
1975,
28
(04):
: 314
-
334
[3]
CLASS OF LINEARLY PARSABLE GRAPH GRAMMARS
FRANCK, R
论文数:
0
引用数:
0
h-index:
0
FRANCK, R
ACTA INFORMATICA,
1978,
10
(02)
: 175
-
201
[4]
Uniquely parallel parsable unification grammars
Lee, J
论文数:
0
引用数:
0
h-index:
0
机构:
Hiroshima Univ, Fac Engn, Higashihiroshima 7398527, Japan
Hiroshima Univ, Fac Engn, Higashihiroshima 7398527, Japan
Lee, J
Morita, K
论文数:
0
引用数:
0
h-index:
0
机构:
Hiroshima Univ, Fac Engn, Higashihiroshima 7398527, Japan
Hiroshima Univ, Fac Engn, Higashihiroshima 7398527, Japan
Morita, K
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS,
2001,
E84D
(01)
: 21
-
27
[5]
Inference of parsable graph grammars for syntactic pattern recognition
Flasinski, Mariusz
论文数:
0
引用数:
0
h-index:
0
机构:
Jagiellonian Univ, Chair Informat Technol Syst, PL-31110 Krakow, Poland
Jagiellonian Univ, Chair Informat Technol Syst, PL-31110 Krakow, Poland
Flasinski, Mariusz
FUNDAMENTA INFORMATICAE,
2007,
80
(04)
: 379
-
413
[6]
A GENERAL SCHEME FOR SOME DETERMINISTICALLY PARSABLE GRAMMARS AND THEIR STRONG EQUIVALENTS
NIJHOLT, A
论文数:
0
引用数:
0
h-index:
0
机构:
RES INST MATH MACHINES, CS-11855 PRAGUE 1, CZECHOSLOVAKIA
RES INST MATH MACHINES, CS-11855 PRAGUE 1, CZECHOSLOVAKIA
NIJHOLT, A
PITTL, J
论文数:
0
引用数:
0
h-index:
0
机构:
RES INST MATH MACHINES, CS-11855 PRAGUE 1, CZECHOSLOVAKIA
RES INST MATH MACHINES, CS-11855 PRAGUE 1, CZECHOSLOVAKIA
PITTL, J
LECTURE NOTES IN COMPUTER SCIENCE,
1982,
145
: 243
-
255
[7]
Uniquely parsable array grammars for generating and parsing connected patterns
Morita, K
论文数:
0
引用数:
0
h-index:
0
机构:
Hiroshima Univ, Fac Engn, Higashihiroshima 7398527, Japan
Hiroshima Univ, Fac Engn, Higashihiroshima 7398527, Japan
Morita, K
Imai, K
论文数:
0
引用数:
0
h-index:
0
机构:
Hiroshima Univ, Fac Engn, Higashihiroshima 7398527, Japan
Hiroshima Univ, Fac Engn, Higashihiroshima 7398527, Japan
Imai, K
PATTERN RECOGNITION,
1999,
32
(02)
: 269
-
276
[8]
COVERING-LANGUAGES OF GRAMMARS
KASAI, T
论文数:
0
引用数:
0
h-index:
0
机构:
KYOTO UNIV,RES INST MATH SCI,KYOTO,JAPAN
KYOTO UNIV,RES INST MATH SCI,KYOTO,JAPAN
KASAI, T
PROCEEDINGS OF THE JAPAN ACADEMY,
1971,
47
: 1025
-
1029
[9]
Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars
Lee, J
论文数:
0
引用数:
0
h-index:
0
机构:
Commun Res Labs, Nanotechnol Grp, Kobe, Hyogo 6512492, Japan
Lee, J
Imai, K
论文数:
0
引用数:
0
h-index:
0
机构:
Commun Res Labs, Nanotechnol Grp, Kobe, Hyogo 6512492, Japan
Imai, K
Morita, K
论文数:
0
引用数:
0
h-index:
0
机构:
Commun Res Labs, Nanotechnol Grp, Kobe, Hyogo 6512492, Japan
Morita, K
THEORETICAL COMPUTER SCIENCE,
2003,
304
(1-3)
: 185
-
200
[10]
SEMANTIC EQUIVALENCE OF COVERING ATTRIBUTE GRAMMARS
BOCHMANN, GV
论文数:
0
引用数:
0
h-index:
0
BOCHMANN, GV
INTERNATIONAL JOURNAL OF COMPUTER & INFORMATION SCIENCES,
1979,
8
(06):
: 523
-
539
←
1
2
3
4
5
→