Паун Г., Розенберг Г., Саломаа А. ДНК-компьютер. Новая парадигма вычислений

Подождите немного. Документ загружается.

Список литературы 501

[67] J. Dassow, Gh. P˘aun. Remarks on operations suggested by

mutations in genomes. Fundamenta Informaticae, 36 (1998), 183–

200.

[68] J. Dassow, Gh. P˘aun, A. Salomaa. Grammars with controlled

derivation. [HFL], Vol. 2, 101–154.

[69] M. D. Davis, E. J. Weyuker. Computability, Complexity, and

Languages. New York: Academic Press, 1983.

[70] M. T. Dawson, R. Powell, F. Gannon. Gene Technology. Oxford:

BIOS Scientiﬁc Publishe rs, 1996.

[71] R. Deaton, et al. A DNA based implementation of an evolutionary

search for good encodings for DNA computation. [EC97], 267–271.

[72] A. De Luca, A. Restivo. A characterization of strictly lo cally

testable languages and its applications to subsemigroups of a f ree

semigroup. Inform. Control, 44 (1980), 300–319.

[73] K. L. Denninghoﬀ, R. W. Gatterdam. On the undecidability of

splicing systems. Intern. J. Computer Math., 27 (1989), 133–145.

[74] S. D´ıaz, J. L. Esteban, M. Ogihara. A DNA-based random walk

method for solving k-SAT. [DNA6], 209–219.

[75] V. Diekert, M. Kudlek. Small deterministic Turing machines.

Papers on Automata and Languages, Dept. Math., Univ.

Economics, Budapest, 188-4 (1989), 77–87.

[76] K. Drlica. Understanding DNA and Gene Clonig. A Guide for the

CURIOUS. New York: John Wiley and Sons, 1992.

[77] P. Duris, J. Hromkovic. One-way simple multihead ﬁnite automata

are not closed under concatenation. Theoretical Computer Sci., 27

(1983), 121–125.

[78] A. Ehrenfeucht, et al. Formal systems for gene assembly in ciliates.

Theoretical Computer Sci., 292 (2003), 199–219.

[79] A. Ehrenfeucht, et al. Computation in Living Cells: Gene Assembly

in Ciliates, Berlin: Springer, 2004.

[80] A. Ehrenfeucht, Gh. P˘aun, G. Rozenb erg. On representing

recursively enumerable languages by internal contextual languages.

Theoretical Computer Sci., 205 (1998), 61–83.

[81] S. Eilenberg. Automata, Languages, and Machines. New York:

Academic Press, Vol. A: 1974, Vol. B: 1976.

[82] T. L. Eng. Linear DNA self-assembly with hairpins generate the

equivalent of linear context-free grammars. [DNA3], 296–301.

[83] J. Engelfriet. Reverse twin-shuﬄes. Bull. EAT CS, 60 (1996), 144.

[84] J. Engelfriet, G. Rozenberg. Fixed point languages, equality

languages, and representations of recursively enumerable

languages. J. ACM, 27 (1980), 499–518.

502 Список литературы

[85] D. Faulhammer, A. R. Cukras, R. J. Lipton, L. F. Land webe r.

When the knight falls: On constructing an RNA c omputer. [DNA5],

1–8.

[86] C. Ferretti, S. Kobayashi, T. Yokomori. DNA splicing systems and

Post systems. [PCB1], 288–299.

[87] C. Ferretti, G. Mauri, S. Kobayashi, T. Yokomori. On the

universality of Post and splicing systems. Theoretical Computer

Sci., 231 (2000), 157–170.

[88] C. Ferretti, G. Mauri, C. Zandron. Nine test tubes generate any

RE language. Theoretical Computer Sci., 231 (2000), 171–180.

[89] R. P. Feynman. There’s plenty of room at the bottom.

Miniaturization (D. H. Gilbert, ed.), New York: Reinhold, 1961,

282–296

[90] R. Freund. Splicing systems on graphs. [INBS], 189–195.

[91] R. Freund, F. Freund. Test tube systems or “how to bake a DNA

cake.” Acta Cybernetica, 12 (1997), 445–459.

[92] R. Freun d, F. Freund. Test tube systems with controlled

applications of rules. [EC97], 237–242.

[93] R. Freund, F. Freund. Test tube systems: when two tubes are

enough. Proc. Intern. Conf. Developments in Language Theory,

DLT’99, Aachen, 1999, 275–286.

[94] R. Freund, F. Freund, M. Oswald. Universal H systems using

multisets, manuscript, 1997.

[95] R. Freund, L. Kari, Gh. P˘aun. DNA computing based on splicing.

The existence of universal computers. Theory of Computing

Systems, 32 (1999), 69–112.

[96] R. Freund, V. Mihalache. Molecular computations on circular and

linear strings. [UMC1], 201–217.

[97] R. Freund, Gh. P˘aun, G. Rozenberg, A. Salomaa. Bidirectional

sticker systems. [PCB3], 535–546.

[98] R. Freund, Gh. P˘aun, G. Rozenberg, A. Salomaa. Watson-Crick

ﬁnite automata. [DNA3], 305–317.

[99] R. Freund, Gh. P˘aun, G. Rozenberg, A. Salomaa. Watson-Crick

automata. Techn. Report 97-13, Dept. of Computer Sci., Leiden

Univ., 1997.

[100] R. Freund, F. Wachtler. Universal systems with operations related

to splicing. Computers and AI, 15 (1996), 273–293.

[101] P. Frisco. Diophantine equations and splicing: a new demonstration

of the generative capability of H systems, [DNA6], 43–52.

[102] P. Frisco, C. Zandron, On variants of communicating distributed

H systems, Fundamenta Informaticae, 48 (2001), 9–20.

Список литературы 503

[103] A. G. Frutos, et al. Demonstration of a word design strategy for

DNA computing on surfaces. Nucleic Acids Research, 25 (1997),

4748.

[104] A. G. Frutos, L. M. Smith, R. M. Corn. Enzymatic ligation

reactions of DNA “words” on surfaces for DNA computing. J. Am.

Chem. Soc., 120 (1998), 10277.

[105] B. Fu, R. Beigel. On molecular approximation algorithms for NP-

optimization problems. [DNA3], 93–101.

[106] Y. Gao, et al. DNA implementation of nonde terminism. [DNA3],

204–211.

[107] M. H. Garzon, K. V. Bobba, A. Neel. Eﬃciency and reliability of

semantic retrieval in DNA-based memories. [DNA9], 157–169.

[108] M. H. Garzon, Ch. Oehmen. Biomolecular computation in virtual

test tubes. [DNA7], 117–128.

[109] R. W. Gatterdam. Splicing systems and regularity. Intern. J.

Computer Math., 31 (1989), 63–67.

[110] R. W. Gatterdam. Algorithms for splicing systems. SIAM J.

Comput., 21 (1992), 507–520.

[111] R. W. Gatterdam. DNA and twist free splicing systems. Words,

Languages, Combinatorics, II (M. Ito, H. J¨urgensen, eds.),

Singapore: World Sc ientiﬁc, 1994, 170–178.

[112] V. Geﬀert. Normal forms for phrase-structure grammars. RAIRO.

Theoretical Inform. and Appl., 25 (1991), 473–496.

[113] G. Georgescu. On the generative capacity of splicing grammar

systems. New Trends in Formal Languages. Control, Cooperation,

and Combinatorics (Gh. P˘aun, A. Salomaa, eds .), Lect. Notes in

Computer Sci., 1218, Berlin: Springer, 1997, 330–345.

[114] A. Gibbons, M. Amos, D. Hodgson. Models of DNA computing.

Proc. 21st MFCS Conf., Cracow, 1996, Lect. Notes Computer Sci.,

1113, Berlin: Springer, 1996, 18–36.

[115] S. Ginsburg. The Mathematical Theory of Context-free Languages,

New York: McGraw Hill, 1966 [Русский перевод: С. Гинзбург.

Математическая теория контекстно-свободных языков. М.:

Мир, 1970]

[116] S. Ginsburg. Algebraic and Automata-Theoretic Properties of

Formal Languages. North-Holland, Amsterdam, 1975.

[117] N. Gnanamalar David, K. G. Subramanian, D. Gnanaraj Thomas.

A note on graph splicing languages. [DNA7], 381–390.

[118] E. Goode, D. Pixton. Semi-simple splicing systems. [MCLB], 343–

352.

504 Список литературы

[119] E. Goode, D. H. Wood, J. Chen. DNA implementation of a Royal

Road ﬁtness evaluation. [DNA6], 247–262.

[120] C. Graciani-D´ıaz, F. J. Mart´ın-Mateos, M. J. P´erez-Jim´enez.

Speciﬁcation of Adleman’s restricted model using an automated

reasoning system: Veriﬁcation of Lipton’s experiment. [UMC3],

126–136.

[121] J. Gruska. Descriptional complexity of context-free languages.

Proc. MFCS Symp., 1973, 71–83.

[122] F. Guarnieri, M. Fliss, C. Bancroft. Making DNA add. Science,

273 (1996), 220–223.

[123] V. Gupta, S. Parthasarathy, M. J. Zaki. Arithmetic and logic

operations with DNA. [DNA3], 212–220.

[124] M. Hagiya, New trends in DNA computing, J. Japan Society for

AI, 15 (2000), 43–50.

[125] M. Hagiya. From molecular computing to molecular programming.

[DNA6], 89–102.

[126] M. Harrison. Introduction to Formal Language Theory. Reading:

Addison-Wesley, 1978.

[127] J. Hartmanis. About the nature of computer science. Bull. EATCS,

53 (1994), 170–190.

[128] J. Hartmanis. On the weight of computation. Bull. EATCS, 55

(1995), 136–138.

[129] D. Hauschild, M. Jantzen. Petri nets algorithms in the theory of

matrix grammars. Acta Informatica, 31 (1994), 719–728.

[130] T. Head. Formal language theory and DNA: An analysis of

the generative capacity of speciﬁc recombinant behaviors. Bull.

Mathematical Biology, 49 (1987), 737–759.

[131] T. Head. Splicing schemes and DNA. Lindenmayer Systems;

Impacts on Theoretical Computer Science and Developmental

Biology (G. Rozenberg, A. Salomaa, eds.), Berlin: Springer, 1992,

371–383.

[132] T. Head. Splicing representations of strictly locally testable

languages. Discrete Appl. Math., 87 (1998), 139–147.

[133] T. Head. Splicing systems and molecular processes. [EC97], 203–

205.

[134] T. Head. Circular suggestions for DNA computing. Pattern

Formation in Biology, Vision and Dynamics (A. Carbone, M.

Gromow, P. Prusinkiewicz, eds.), Singapore: World Scientiﬁc, 2000,

325–335.

[135] T. Head, et al. Aqueous solutions of algorithmic problems:

Emphasizing knights on a 3 × 3. [DNA7], 191–202.

Список литературы 505

[136] T. Head, S. Gal. Aqueous computing: writing into ﬂuid memory.

Bull. EATCS, 75 (2001), 190–198.

[137] T. Head, D. Pixton, E. Goode. Splicing systems: regularity and

below. [DNA8], 262–268.

[138] T. Head, M. Yamamura, S. Gal. Aqueous computation. Writing

on molecules. Proc. IEEE Congress on Evolutionary Computing,

Piscataway, NJ, 1999, 1006–1010.

[139] T. Head, Gh. P˘aun, D. Pixton. Language theory and

molecular genetics. Generative mechanisms suggested by DNA

recombination. [HFL], Vol. 2, 295–360.

[140] G. T. Herman, G. Rozenberg. Developmental Systems and

Languages. Amsterdam: North-Holland, 1975.

[141] J. Hertz, A. Krogh, R. G. Palmer. Introduction to the Theory of

Neural Computation. Reading: Addison-Wesley, 1991.

[142] T. Hinze, U. Hatnik, M. Sturm. An object oriented simulation of

real occurring molecular biological processes for DNA computing

and its experimental veriﬁcation. [DNA7], 1–13.

[143] H. J. Hoogeboom, N. van Vugt. Fair sticker languages. Acta

Informatica, 37 (2000) 213–225.

[144] H. J. Hoogeboom, N. van Vugt. Upper bounds for restricted

splicing. [FNC], 361–375.

[145] J. E. Hopcroft, J. D. Ullman. Introduction to Automata Theory,

Languages and Computation. Reading: Addison-Wesley, 1979.

[146] J. Hromkovic. One-way multihead deterministic ﬁnite automata.

Acta Informatica, 19 (1983), 377–384.

[147] H. Hug, R. Schuler. DNA-based parallel computation of simple

arithmetic. [DNA7], 321–328.

[148] H. Hug, R. Schuler. Implementation of a random walk method for

solving 3-SAT on circular DNA molecules. [DNA7], 133–142.

[149] L. Hunter. Molecular biology for computer s cientists. Artiﬁcial

Intelligence and Molecular Biology (L. Hunter, ed.), AAAI

Press/MIT Press, Menlo Park, Calif., 1993, 1–46.

[150] S. Hussini, L. Kari, S. Konstantinidis. Coding properties of DNA

languages. [DNA7], 57–69.

[151] O. H. Ibarra, C. E. Kim. On 3-head versus 2-head ﬁnite automata.

Inform. Control, 4 (1975), 193–200.

[152] L. Ilie, V. Mitrana. Crossing-over on languages. A formal

representation of the chromosome recombination. [GCB], 202–

204.

[153] N. Jonoska, S. A. Karl. Ligation experiments in computing with

DNA. [EC97], 261–265.

506 Список литературы

[154] A. Kameda, et al. Conformational addressing using the hairpin

structure of single-strand DNA. [DNA9], 219–223.

[155] L. Kari. On Insertion and Deletion in Formal Languages. Ph.D.

Thesis, Univ. of Turku, 1991.

[156] L. Kari. DNA computing: tomorrow’s reality. Bull. EATCS, 59

(1996), 256–266, см. также [CTCS], 811–829.

[157] L. Kari, R. Kitto, G. Gloor, A computer scientist’s guide to

molecular biology, Soft Computing, 5 (2001), 95–101.

[158] L. Kari, A. P˘aun. String operations suggested by DNA

biochemistry: the balanced cut operation. Words, Semigroups,

Transducers (M. Ito, Gh. P ˘aun, S. Yu, eds.), Singapore: World

Scientiﬁc, 2001, 275–288.

[159] L. Kari, Gh. P˘aun, G. Rozenberg, A. Salomaa, S. Yu . DNA

computing, sticker systems, and universality. Acta Informatica, 35

(1998), 401–420.

[160] L. Kari, Gh. P˘aun, A. Salomaa. The power of restricted splicing

with rules from a regular set. J. Universal Computer Sci., 2 (1996),

224–240.

[161] L. Kari, Gh. P˘aun, G. Thierrin, S. Yu. At the crossroads of

DNA comp uting and formal languages: Characterizing RE using

insertion-deletion systems. [DNA3], 318–333.

[162] L. Kari, G. Thierrin. Contextual insertion/deletion and

computability. Inform. Computation, 131 (1996), 47–61.

[163] S. Kashiwamura, et al. Towards optimization of PCR protocol in

DNA computing. [DNA7], 14–22.

[164] S. Kashiwamura, et al. Hierarchical DNA memory based on nested

PCR. [DNA8], 112–123.

[165] J. Khodor, D. K. Giﬀord. Design and implementation of

computational systems based on programmed mutagenesis.

BioSystems 52 (1999), 93–97.

[166] J. Khodor, D. K. Giﬀord. Programmed mutagenesis is a universal

model of computation. [DNA7], 300–307.

[167] S. M. Kim. Identifying genetically spliced languages. [EC97], 231–

235.

[168] S. M. Kim. Computational modeling for genetic splicing systems.

SIAM J. Computing, 26 (1997), 1284–1309.

[169] S. Kobayashi, T. Yokomori, G. Sampei, K. Mizob uchi. DNA

implementation of simple Horn clause computation. [EC97], 213–

217.

[170] J. H. Koza, J. P. Rice. Genetic Algorithms: The Movie. Cambridge:

MIT Press, 1992.

Список литературы 507

[171] K. Krithivasan, V. T. Chakaravarthy, R. Rama. Array splicing

systems. New Trends in Formal Languages. Control, Cooperation,

and Combinatorics (Gh. P˘aun, A. Salomaa, eds .), Lect. Notes in

Computer Sci. 1218, Berlin: Springer, 1997, 346–365.

[172] M. Kudlek, Yu. Rogozhin. A universal Turing machine with 3 states

and 9 symbols. Developments in Language Theory. 5th Intern.

Conf. (W. Kuich, G. Rozenberg, A. Salomaa, eds.), Lect. Notes

Computer Sci. 2295, Berlin: Springer, 2002, 311–318.

[173] S. Landau. Standing the test of time: the Data Encryption

Standard. Notices AMS, 47 (2000), 341–349.

[174] M. Latteux, B. Leguy, B. Ratoandromanana. The family of one-

counter languages is closed under quotient. Acta Informatica, 22

(1985), 579–588.

[175] L. F. Landweber, R. J. Lipton. DNA to DNA: A potential “killer

app”? [DNA3], 161–172.

[176] E. Laun, K. J. Reddy. Wet splicing systems. [DNA3], 73–82.

[177] I.-H. Lee, et al. DNA implementation of theorem proving with

resolution refutation in propositional logic. [DNA8], 156–167.

[178] J. Y. Lee, et al. Temperature gradient-based DNA computing for

graph problems with weighted edges. [DNA8], 73–84.

[179] T. H. Leete, J. P. Klein, H. Rubin. Bit operations using a DNA

template. [DNA3] (Preproceedings version), 159–171.

[180] A. Leier, Ch. Richter, W. Banzhaf, H. Rauhe. Cryptography with

DNA binary strands. Biosystems, 57 (2000), 13–22.

[181] M. Li, H. J. Lee, A. E. Condon, R. M. Corn. A DNA word design

strategy for creating sets of non-interacting oligonucleotides for

DNA microarrays. Langmuir, 73 (2002), 805–812.

[182] W.-H. Li, D. Graur. Fundamentals of Molecular Evolution.

Sunderland: Sinauer Ass., 1991.

[183] H.-W. Lim, et al. Version space learning with DNA molecules.

[DNA8], 143–155.

[184] R. J. Lipton. Using DNA to solve NP- complete problems. Science,

268 (1995), 542–545.

[185] R. J. Lipton. Speeding up computations via molecular biology.

[DNA1], 67–74.

[186] Q. Liu, et al. DNA computing on surfaces. Nature, 403 (2000),

175–179.

[187] M. S. Livstone, L. F. Landweber. Mathematical considerations in

the design of microreactor-based DNA computers. [DNA8], 180–

189.

508 Список литературы

[188] M. Lothaire. Combinatorics on Words. Reading: Addison-Wesley,

Mass., 1983.

[189] M. Mali¸ta, Gh. ¸Stefan. DNA computing with the connex memory.

[EC97], 225–229.

[190] V. Manca. Logical splicing in natural languages. Issues in

Mathematical Linguistics (C. Martin-Vide, ed.), Amsterdam: John

Benjamins, 1999, 131–143.

[191] V. Manca. On some forms of splicing. [MCLB], 387–398.

[192] V. Manca. DNA and membrane algorithms for SAT. Fundamenta

Informaticae, 49 (2002), 205–221.

[193] V. Manca, C. Martin-Vide, Gh. P˘aun. New computing paradigms

suggested by DNA computing: Computing by carving. Biosystems,

52 (1999), 47–54.

[194] V. Manca, Gh. P˘aun. Arithmetically controlled H systems.

Computer Sci. J. Moldova, 6 (1998), 103–118.

[195] V. Manca, C. Zandron. A clause string DNA algorithm for SAT.

[DNA7], 172–181.

[196] G. Manganaro, J. P. deGyvez. DNA c omputing based on chaos.

[EC97], 255–260.

[197] S. Marcus. Contextual grammars. Rev. Roum. Math. Pures Appl.,

14 (1969), 1525–1534.

[198] S. Marcus. Linguistic structures and generative devices in

molecular genetics. Cah. Ling. Th. Appl., 11 (1974), 77–104.

[199] S. Marcus. Language at the crossroad of computation and biology.

[CBTE], 1–35.

[200] M. Margenstern, Y. Rogozhin. Time- varying distributed H systems

of degree 2 generate all RE langu ages. [MCLB], 399–407.

[201] M. Margenstern, Y. Rogozhin. An universal time-varying

distributed H system of degree 2. Biosystems, 52 (1999), 73–80.

[202] M. Margenstern, Y. Rogozhin. About time-varying distributed H

systems, [DNA6], 53–62.

[203] M. Margenstern, Y. Rogozhin. A universal time-varying

distributed H system of degree 1. [DNA7], 371–380.

[204] M. Margenstern, Y. Rogozhin, S. Verlan. Time-varying distributed

H systems of degree 2 can carry out parallel computations. [DNA8],

326–336.

[205] M. Margenstern, Y. Rogozhin, S. Verlan. Time-varying distributed

H systems with parallel computations: The problem is solved.

[DNA9], 48–53.

Список литературы 509

[206] A. F. Markham, et al. Solid phase phosphotriester synthesis of large

oligodeoxyribonucleotides on a polyamide support. Nucleic Acids

Research, 8 (1980), 5193–5205.

[207] F. J. Mart´ın-Mateos, J. A. Alonso, M. J. P´erez-Jim´enez. Molecular

computation models in ACL2: A simulation of Lipton’s SAT

experiment in the Adleman’s restricted mo del. Proc. 3rd Intern.

Workshop on the ACL2 Theorem Prover and Its Applications, 2002,

175–187.

[208] C. Martin-Vide, Gh. P˘aun. Cooperating distributed splicing

systems. J. Automata, Languages and Combinatorics, 4 (1999),

3–16.

[209] C. Martin-Vide, Gh. P˘aun, G. Rozenberg, A. Salomaa. Universality

results for ﬁnite H systems and for Watson–Crick ﬁnite automata.

[CBTE], 200–220.

[210] C. Martin-Vide, Gh. P˘aun, A. Salomaa. Characterizations of

recursively enumerable languages by means of insertion grammars.

Theoretical Computer Sci., 205 (1998), 195–205.

[211] A. Mateescu. Splicing on routes: A framework for DNA

computation. [UMC1], 273–285.

[212] A. Mateescu, Gh. P˘aun, G. Rozenberg, A. Salomaa. Simple splicing

systems. Discrete Appl. Math., 84 (1998), 145–163.

[213] A. Mateescu , Gh. P˘aun, A. Salomaa. Variants of twin-shuﬄe

languages, manuscript, 1998.

[214] J. S. McCaskill. Optically programming DNA computing in

microﬂow reactors. Biosystems, 59 (2001), 125–138.

[215] J. S. McCaskill, et al. Steady ﬂow micro-reactor module for

pipelined DNA computations. [DNA6], 263–270.

[216] J. S. McCaskill, U. Niemann. Graph replacement chemistry for

DNA processing. [DNA6], 103–116.

[217] R. McNaughton, S. Papert. Counter-Free Automata. Cambridge:

MIT Press, 1971.

[218] V. Mihalache. Prolog approach to DNA computing. [EC97], 249–

254.

[219] V. Mihalache, Gh. P˘aun, G. Rozenberg, A. Salomaa. Gene rating

strings by replication: a simple case. Report TUCS No. 17, Turku,

Finland, 1996.

[220] V. Mihalache, A. Salomaa. Growth functions and length sets of

replicating systems. Acta Cybern., 12, 3 (1996), 235–247.

[221] V. Mihalache, A. Salomaa. Lindenmayer and DNA: Watson–

Crick D0L systems. Bull. EATCS, 62 (1997), 160–175, см. также

[CTCS], 740–751.

510 Список литературы

[222] V. Mihalache, A. Salomaa. Language-theoretic aspects of DNA

complementarity. Theoretical Computer Sci., 250 (2001), 163–178.

[223] M. Minsky. Computation. Finite and Inﬁnite Machines. Englewood

Cliﬀs: Prentice Hall, 1967.

[224] V. Mitrana. On the interdependence between shuﬄe and crossing-

over operations. Acta Informatica, 34 (1997), 257–266.

[225] N. Morimoto, M. Arita, A. Su yama. Solid phase DNA solution to

the Hamiltonian path problem. [DNA3], 193–206.

[226] N. Nitta, A. Suyama. Autonomous biomolecular computer mo dele d

after retroviral replication. [DNA9], 203–207.

[227] M. Ogihara, A. Ray. DNA-based parallel computation by

“counting”. [DNA3], 265–274.

[228] M. Ogihara, A. Ray. The minimum DNA computation model and

its computational power. [UMC1], 309–322.

[229] J. Parkkinen, S. Parkkinen, Gh. P˘aun. Computing by splicing:

gsm’s working on circular words, manuscript, 1996.

[230] A. P˘aun. Extended H systems with permitting contexts of small

radius. Fundamenta Informaticae, 31 (1997), 185–193.

[231] A. P˘aun. On time-varying H systems. Bull. EATCS, 67 (1999),

157–164.

[232] A. P˘aun. On the diameter of various classes of H systems. J.

Automata, Languages and Combinatorics, 5 (2000), 315–324.

[233] A. P˘aun, M. P˘aun. Controlled and distributed H systems of small

radius. [CBTE], 239–254.

[234] A. P˘aun, M. P˘aun. State and transition complexity of Watson–

Crick ﬁnite automata. Fundamentals of Computation Theory,

FCT’99, Ia¸si, Lect. Notes Computer Sci.. 1684, Berlin: Springer,

1999, 409–420.

[235] Gh. P˘aun. On the iteration of gsm mappings. Revue Roum. Math.

Pures Appl., 23 (1978), 921–937.

[236] Gh. P˘aun. On semicontextual grammars. Bull. Math. Soc. Sci.

Math. Roumanie, 28(76) (1984), 63–68.

[237] Gh. P˘aun. Two theorems about Galiukschov semicontextual

grammars. Kybernetika, 21 (1985), 360–365.

[238] Gh. P˘aun. A characterization of recursively enumerable languages.

Bull. EATCS, 45 (1991), 218–222.

[239] Gh. P˘aun. On the splicing operation. Discrete Appl. Math., 70

(1996), 57–79.

[240] Gh. P˘aun. On the power of the splicing operation. Intern. J.

Computer Math., 59 (1995), 27–35.