Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Theoretical Computer Science 341 (2005) 247262 www.elsevier.com/locate/tcs
 

Summary: Theoretical Computer Science 341 (2005) 247­262
www.elsevier.com/locate/tcs
Towards a proof of the decidability of the
momentary stagnation of the growth function of
D0L systems
Blanca Casesa,1
, Manuel Alfonsecab,,2
aDepartamento de Lenguajes y Sistemas Informáticos, Universidad del País Vasco/Euskal Herriko
Unibertsitatea, 20080 Guipúzcoa, Spain
bEscuela Politécnica Superior, Department of Computer Engineering, Universidad Autónoma de Madrid,
Madrid 28049, Spain
Received 8 June 2004; received in revised form 5 January 2005; accepted 19 May 2005
Communicated by M. Ito
Abstract
This paper proves the decidability of several problems in the theory of HD0L, D0L and PD0L
systems, some of which that have been proved before but are now proved in a different way. First,
the paper tackles the decidability of the nilpotency of HD0L systems and the infinitude of PD0L
languages. Then, we prove the decidability of the problem of momentary stagnation of the growth
function of PD0L systems. Finally, we suggest a way to solve the decidability of the momentary
stagnation of the growth function of D0L systems, proving the decidability of the infinitude of HD0L

  

Source: Alfonseca, Manuel - Escuela Politécnica Superior, Universidad Autonoma de Madrid

 

Collections: Computer Technologies and Information Sciences; Engineering