On simple representations of language families

K. Culik II; H. A. Maurer

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

  • Volume: 13, Issue: 3, page 241-250
  • ISSN: 0988-3754

How to cite

top

Culik II, K., and Maurer, H. A.. "On simple representations of language families." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 13.3 (1979): 241-250. <http://eudml.org/doc/92102>.

@article{CulikII1979,
author = {Culik II, K., Maurer, H. A.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {characterization of families of languages},
language = {eng},
number = {3},
pages = {241-250},
publisher = {EDP-Sciences},
title = {On simple representations of language families},
url = {http://eudml.org/doc/92102},
volume = {13},
year = {1979},
}

TY - JOUR
AU - Culik II, K.
AU - Maurer, H. A.
TI - On simple representations of language families
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1979
PB - EDP-Sciences
VL - 13
IS - 3
SP - 241
EP - 250
LA - eng
KW - characterization of families of languages
UR - http://eudml.org/doc/92102
ER -

References

top
  1. 1. R. V. BOOK, Comparing Complexity Classes, J. Comput. System Sc., Vol. 9, 1974, pp. 213-229. Zbl0331.02020MR366099
  2. 2. K. CULIK II, On Some Families of Languages Related to Developmental Systems, Intern. J. Comput. Math., Vol. 4, 1974, pp. 31-42. Zbl0294.68025MR363009
  3. 3. K. CULIK II, A Purely Homomorphic Characterization of Recursive Enumerable Sets, J. Assoc. Comput. Mach., Vol. 26, 1979, pp. 345-350. Zbl0395.68076MR528036
  4. 4. K. CULIK II and H. A. MAURER, Propagating Chain-Free Normal Forms for EOL Systems, Information and Control, Vol. 36, 1978, pp. 309-319. Zbl0368.68071MR468336
  5. 5. S. EILENBERG, Automata, Languages and Machines, Vol. A, Academic Press, 1974. Zbl0317.94045MR530382
  6. 6. J. ENGELFRIET and G. ROZENBERG, Fixed Point Languages, Equality Languages and Representations of Recursively Enumerable Languages, 19th Annual Symposium on Foundations of Computer Science, 1978, pp. 123-126. Zbl0475.68047
  7. 7. S. GINSBURG, Algebraic and Automata-Theoretic Properties of Formal Languages, North Holland, Amsterdam, 1975. Zbl0325.68002MR443446
  8. 8. S. GREIBACH, The Hardest CF Language, S.I.A.M. J. Comput., Vol. 2, 1973, pp. 304-310. Zbl0278.68073MR334591
  9. 9. M. A. HARRISON, Introduction to Formal Language Theory, Addison-Wesley, Reading, Mass., 1978. Zbl0411.68058MR526397
  10. 10. J. E. HOPCROFT and J. D. ULLMAN, Formal Languages and Their Relation to Automata, Addison-Wesley, Reading, Mass., 1969. Zbl0196.01701MR237243
  11. 11. H. A. MAURER, Theoretische Grundlagen der Programmiersprachen, BI, Marmheim, 1969. Zbl0204.31801MR403292
  12. 12. A. SALOMAA, Formal Languages, Academic Press, New York, 1973. Zbl0262.68025MR438755
  13. 13. A. SALOMAA, Theory of Automata, Pergamon Press, London, 1969. Zbl0193.32901MR262021
  14. 14. B. WEGBREIT, A Generator of Context Sensitive Languages, J. Comput. System Sc., Vol. 3, 1969, pp. 456-461. Zbl0205.31302MR284301

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.