On the equivalence of compositions of morphisms and inverse morphisms on regular languages

J. Karhumäki; H. C. M. Kleijn

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

  • Volume: 19, Issue: 3, page 203-211
  • ISSN: 0988-3754

How to cite

top

Karhumäki, J., and Kleijn, H. C. M.. "On the equivalence of compositions of morphisms and inverse morphisms on regular languages." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 19.3 (1985): 203-211. <http://eudml.org/doc/92230>.

@article{Karhumäki1985,
author = {Karhumäki, J., Kleijn, H. C. M.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {decidability; undecidability; transductions},
language = {eng},
number = {3},
pages = {203-211},
publisher = {EDP-Sciences},
title = {On the equivalence of compositions of morphisms and inverse morphisms on regular languages},
url = {http://eudml.org/doc/92230},
volume = {19},
year = {1985},
}

TY - JOUR
AU - Karhumäki, J.
AU - Kleijn, H. C. M.
TI - On the equivalence of compositions of morphisms and inverse morphisms on regular languages
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1985
PB - EDP-Sciences
VL - 19
IS - 3
SP - 203
EP - 211
LA - eng
KW - decidability; undecidability; transductions
UR - http://eudml.org/doc/92230
ER -

References

top
  1. 1. J. BERSTEL, Transductions and Context-Free Languages (B. G. Teubner, Stuttgard, 1979). Zbl0424.68040MR549481
  2. 2. M. BLATTNER and T. HEAD, Single-valued a-transducers, J. Comput. System Sci. 15 (1977) 310-327. Zbl0367.94071MR462810
  3. 3. K. CULIK II, F. E. FICH and A. SALOMAA, A homomorphic characterization of regular languages, Discrete Appl. Math. 4 (1982) 149-152. Zbl0481.68069MR677880
  4. 4. K. CULIK II and A. SALOMAA, On the decidability of homomorphism equivalence for languages, J. Comput. System Sci. 17 (1978) 163-175. Zbl0389.68042MR514269
  5. 5. S. EILENBERG, Automata, Languages, and Machines, Vol. A (Academic Press, New York, 1974). Zbl0317.94045MR530382
  6. 6. T. V. GRIFFITHS, The unsolvability of the equivalence problem for λ-free nondeterministic generalized machines, J. Assoc. Comput. Mach. 15 (1968) 409-413. Zbl0162.02302MR235925
  7. 7. J. KARHUMÄKI and Y. MAON, A simple undecidable problem : Existential agreement of inverse of two morphisms on a regular language, submitted for publication. Zbl0615.68051
  8. 8. J. KARHUMÄKI and M. LINNA, A note on morphic characterization of languages, Discrete Appl. Math. 5 (1983) 243-246. Zbl0499.68031MR683516
  9. 9. J. KARHUMÄKI and D. WOOD, Inverse morphic equivalence on languages, manuscript (1983). Zbl0571.68061MR777801
  10. 10. M. LATTEUX and J. LEGUY, On the composition of morphisms and inverse morphisms, Lecture Notes in Computer Science 154 (1983) 420-432. Zbl0523.68067MR727673
  11. 11. P. TURAKAINEN, On homomorphic characterization of principal semi AFL's without using intersection with regular sets, Inform. Sci. 27 (1982) 141-149. Zbl0506.68063MR678037
  12. 12. P. TURAKAINEN, A machine-oriented approach to compositions of morphisms and inverse morphisms, EATCS Bull. 20 (1983) 162-166. 

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.