The decidability of the equivalence problem for polynomially bounded DOL sequences

Juhani Karhumäki

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1977)

  • Volume: 11, Issue: 1, page 17-28
  • ISSN: 0988-3754

How to cite

top

Karhumäki, Juhani. "The decidability of the equivalence problem for polynomially bounded DOL sequences." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 11.1 (1977): 17-28. <http://eudml.org/doc/92039>.

@article{Karhumäki1977,
author = {Karhumäki, Juhani},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
language = {eng},
number = {1},
pages = {17-28},
publisher = {EDP-Sciences},
title = {The decidability of the equivalence problem for polynomially bounded DOL sequences},
url = {http://eudml.org/doc/92039},
volume = {11},
year = {1977},
}

TY - JOUR
AU - Karhumäki, Juhani
TI - The decidability of the equivalence problem for polynomially bounded DOL sequences
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1977
PB - EDP-Sciences
VL - 11
IS - 1
SP - 17
EP - 28
LA - eng
UR - http://eudml.org/doc/92039
ER -

References

top
  1. 1. K. CULIK, II, On the Decidability of the Sequence Equivalence Problem for DOL-Systems, Manuscript, 1975. Zbl0352.68103MR495228
  2. 2. A. EHRENFEUCHT and G. ROZENBERG, DOL-Systems with Rank, Lecture Notes in Computer Science, Springer, Vol. 15, 1974, pp. 136-141. Zbl0293.68063MR428816
  3. 3. S. GINSBURG, The Mathematical Theory of Context-Free Languages, McGraw-Hill, New York, 1966. Zbl0184.28401MR211815
  4. 4. G. HERMAN and G. ROZENBERG, Developmental Systems and Languages, North-Holland, Amsterdam, 1975. Zbl0306.68045MR495247
  5. 5. K. P. LEE and G. ROZENBERG, The Length Sets of DOL Languages Are Uniformely Bounded, Information Processing Letters, Vol. 2, 1974, pp. 185-188. Zbl0282.68037MR431803
  6. 6. M. NIELSEN, On the Decidability of Some Equivalence Problems For DOL-Systems, Information and Control, Vol. 25, 1974, pp. 166-193. Zbl0284.68065MR345455
  7. 7. Problem book. Unusual Automata Theory, January 1972, Dept. of Computer Science, Univ. of Aarhus, Tech. Report DAIMI PB-15, 1973, pp. 14-26. 
  8. 8. G. ROZENBERG and A. SALOMAA, The Mathematical Theory of L Systems, in J. T. Tou (éd.), Advances in Information Systems Science, Plenum Press, New York, Vol. 6, 1976, pp. 161-206. Zbl0365.68072MR471464
  9. 9. L. G. VALIANT, The Equivalence Problem for DOL Systems and its Decidability for Binary Alphabets, Manuscript, 1975. 

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.