Inoue, K.,
Takanami, I.,
Taniguchi, H.,
Two-Dimensional Alternating Turing Machines,
TCS(27), 1983, pp. 61-83.
BibRef
Szepietowski, A.,
On Searching Plane Labyrinths By 1-Pebble Automata,
EIK(19), 1983, pp. 79-84.
BibRef
Starke, P.H.,
Graph Grammars For Petri Net Processes,
EIK(19), 1983, pp. 199-233.
BibRef
Maruoka, A.,
Open Maps For Tessellation Automata,
TCS(27), 1983, pp. 217-224.
BibRef
Morita, K.,
Yamamoto, Y.,
Sugata, K.,
The Complexity Of Some Decision Problems About Two-Dimensional Array Grammars,
INFORMATION SCIENCES(30), 1983, pp. 241-262.
BibRef
Engels, G.,
Gall, R.,
Nagl, M.,
Schafer, W.,
Software Specification Using Graph Grammars,
COMPUTING(31), 1983, pp. 317-346.
BibRef
Paul, W.,
On Heads Versus Tapes,
TCS(28), 1984, pp. 1-12.
BibRef
Ibarra, O.H.,
Kim, S.M.,
Characterizations And Computational Complexity Of Systolic Trellis Automata,
TCS(29), 1984, pp. 123-153.
BibRef
Miyajima, H.,
Harao, M.,
Noguchi, S.,
Indecomposable Maps In Tessellation Structures Of Arbitrary Dimension,
J. COMPUTER SYSTEM SCIENCES(29), 1984, pp. 171-182.
BibRef
Ibarra, O.H.,
Kim, S.M.,
A Characterization Of Systolic Binary Tree Automata And Applications,
ACTA INFORMATICA(21), 1984, pp. 193-207.
BibRef
Choffrut, C.,
Culik II, K.,
On Real-Time Cellular Automata And Trellis Automata,
ACTA INFORMATICA(21), 1984, pp. 393-407.
BibRef
Ehrenfeucht, A.,
Main, M.G.,
Rozenberg, G.,
Restrictions On Nlc Graph Grammars,
TCS(31), 1984, pp. 211-223.
BibRef
Raoult, J.C.,
On Graph Rewritings,
TCS(32), 1984, pp. 1-24.
BibRef
Culik II, K.,
Yu, S.,
Iterative Tree Automata,
TCS(32), 1984, pp. 227-247.
BibRef
Kreowski, H.J.,
Rozenberg, G.,
Note On Node-Rewriting Graph Grammars,
IPL(18), 1984, pp. 21-24.
BibRef
Yodogawa, E.,
A Note On Array Grammars,
IPL(18), 1984, pp. 51-54.
BibRef
Bokhari, S.H.,
Finding Maximum On An Array Processor With A Global Bus,
T-COMP(33), 1984, pp. 133-139.
BibRef
Inoue, K.,
Takanami, I.,
Nakamura, A.,
Connected Pictures Are Not Recognizable By Deterministic Two Dimensional On-Line Tessellation Acceptors,
CVGIP(26), 1984, pp. 126-129.
BibRef
Atallah, M.J.,
Kosaraju, S.R.,
Graph Problems On A Mesh-Connected Processor Array,
J. ACM(31), 1984, pp. 649-667.
BibRef
Ejsmont, M.,
Problems In Labyrinths Decidable By Pebble Automata,
EIK(20), 1984, pp. 623-632.
BibRef
Chapter on Rosenfeld Bibliography for 1984 continues in
K. 3-D Scene Analysis .