Automates boustrophedon, semi-groupe de Birget et monoïde inversif libre

J. P. Pécuchet

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

  • Volume: 19, Issue: 1, page 71-100
  • ISSN: 0988-3754

How to cite

top

Pécuchet, J. P.. "Automates boustrophedon, semi-groupe de Birget et monoïde inversif libre." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 19.1 (1985): 71-100. <http://eudml.org/doc/92224>.

@article{Pécuchet1985,
author = {Pécuchet, J. P.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {rational languages; two-way automata; rational sets; Birget's semigroup; free inverse monoid},
language = {fre},
number = {1},
pages = {71-100},
publisher = {EDP-Sciences},
title = {Automates boustrophedon, semi-groupe de Birget et monoïde inversif libre},
url = {http://eudml.org/doc/92224},
volume = {19},
year = {1985},
}

TY - JOUR
AU - Pécuchet, J. P.
TI - Automates boustrophedon, semi-groupe de Birget et monoïde inversif libre
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1985
PB - EDP-Sciences
VL - 19
IS - 1
SP - 71
EP - 100
LA - fre
KW - rational languages; two-way automata; rational sets; Birget's semigroup; free inverse monoid
UR - http://eudml.org/doc/92224
ER -

References

top
  1. 1. AHO, HOPCROFT et HULLMAN, Time and Tape Complexity of Pushdown Automaton Languages, Information and Control, vol. 13, n° 3, 1968, p. 186-206. Zbl0257.68065
  2. 2. BERSTEL, Transductions and Context-Free Languages, Teubner, 1979. Zbl0424.68040MR549481
  3. 3. BIRGET, Ph. D, Un. of California, Berkeley, 1983. 
  4. 4. EILENBERG, Automata, Languages and Machines, Vol. A, Acad. Press, 1974. Zbl0317.94045
  5. 3. MUNN, Free Inverse Semigroup, Proc. London Math. Soc., (3), vol. 29, 1974, p. 385-404. Zbl0305.20033MR360881
  6. 6. SCHEIBLICH, Free Inverse semigroups, Proc. Amer. Math. Soc., vol. 38, 1973, p. 1-7. Zbl0256.20079MR310093
  7. 7. SHEPHERDSON, The Reduction of Two-Way Automata to One-Way Automata, I.B.M. J. Res., vol. 3, n° 2, 1959, p. 198-200. Zbl0158.25601MR103796
  8. 8. PÉCUCHET, Automates Boustrophédon et mots infin, T.C.S. (à paraître). Zbl0571.68074

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.