Sur quelques classes d’applications de N 2 dans les ensembles finis

Jean Moulin Ollagnier

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

  • Volume: 23, Issue: 4, page 461-492
  • ISSN: 0988-3754

How to cite

top

Moulin Ollagnier, Jean. "Sur quelques classes d’applications de $N^2$ dans les ensembles finis." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 23.4 (1989): 461-492. <http://eudml.org/doc/92345>.

@article{MoulinOllagnier1989,
author = {Moulin Ollagnier, Jean},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {trellis automata; sub-Markovian -mappings},
language = {fre},
number = {4},
pages = {461-492},
publisher = {EDP-Sciences},
title = {Sur quelques classes d’applications de $N^2$ dans les ensembles finis},
url = {http://eudml.org/doc/92345},
volume = {23},
year = {1989},
}

TY - JOUR
AU - Moulin Ollagnier, Jean
TI - Sur quelques classes d’applications de $N^2$ dans les ensembles finis
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1989
PB - EDP-Sciences
VL - 23
IS - 4
SP - 461
EP - 492
LA - fre
KW - trellis automata; sub-Markovian -mappings
UR - http://eudml.org/doc/92345
ER -

References

top
  1. 1 J. BERSTEL, Every Iterated Morphism Yields a co-CFL, Inform. Processing Letters, vol. 22, 1986, p. 7-9. Zbl0584.68082MR825639
  2. 2 A. CERNY et J. GRUSKA, Modular Trellis Automata, preprint 1986, Fundamenta Informaticae (à paraître). Zbl0642.68091MR862698
  3. 3 A. CERNY et J. GRUSKA, Modular Trellises, preprint 1986. MR862698
  4. 4 A. COBHAM, On the Base-Dependence of Sets of Numbers Recognizable by Finite Automata, Math. Systems Theory, vol.3, 1969, p. 186-192. Zbl0179.02501MR250789
  5. 5 A. COBHAM, Uniform Tag Sequences, Math. Systems Theory, vol. 6, 1972, p. 164-192. Zbl0253.02029MR457011
  6. 6 K. CULIK, J. GRUSKA et A. SALOMAA, Systolic Trellis Automata : Stability, Decidability and Complexity, Res. Report CS-82-04, Univ. of Waterloo, 1982. Zbl0626.68048
  7. 7 K. CULIK, J. GRUSKA et A. SALOMAA, Systolic Trellis Automata, Intern. Jour. Computer Math., vol. 15, 1984, p. 195-212 et vol. 16, 1984, p. 3-22. Zbl0571.68041MR754266
  8. 8 S. EILENBERG et M. P. SCHUTZENBERGER, Rational Sets in Commutative Monoids, Journal of Algebra, vol. 13, 1969, p. 173-191. Zbl0206.02703MR246985
  9. 9 S. GINSBURG et E. H. SPANIER, Bounded ALGOL-like Languages, Trans. Amer. Math. Soc., vol. 113, 1964, p. 333-368. Zbl0142.24803MR181500
  10. 10 R. ITO, Every semilinear Set is a Finite Union of Disjoint linear Sets, J.C.S.S., vol. 8, 1969, p. 221-231. Zbl0187.28503MR242851
  11. 11 I. KOREC, Generalized Pascal Triangles: Decidability results, Acta Math. Univ. Comen., Bratislava, 1985 (à paraître). Zbl0607.05002MR872334

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.