Fermeture de certaines classes de langages formels sous des permutations linguistiques

Claude Boucher

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique (1969)

  • Volume: 3, Issue: R2, page 51-61
  • ISSN: 0764-583X

How to cite

top

Boucher, Claude. "Fermeture de certaines classes de langages formels sous des permutations linguistiques." ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique 3.R2 (1969): 51-61. <http://eudml.org/doc/193123>.

@article{Boucher1969,
author = {Boucher, Claude},
journal = {ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique},
language = {fre},
number = {R2},
pages = {51-61},
publisher = {Dunod},
title = {Fermeture de certaines classes de langages formels sous des permutations linguistiques},
url = {http://eudml.org/doc/193123},
volume = {3},
year = {1969},
}

TY - JOUR
AU - Boucher, Claude
TI - Fermeture de certaines classes de langages formels sous des permutations linguistiques
JO - ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique
PY - 1969
PB - Dunod
VL - 3
IS - R2
SP - 51
EP - 61
LA - fre
UR - http://eudml.org/doc/193123
ER -

References

top
  1. [1] Y. BAR-HILLEL, M. PERLES et E. SHAMIR, On formal properties of simple phrase structure grammars. Z. Phonetik, Sprach. Kommunikationsforsch., vol. 14, 1961, pp. 143-172. Zbl0106.34501MR151376
  2. [1] N. CHOMSKY, On certain formal properties of grammars. Information and Control, vol. 2, 1959, pp. 137-167. Zbl0088.10801MR105365
  3. [2] N. CHOMSKY, Context-free grammars and pushdown storage. M.I.T. Res. Lab. Electron. Quant. Prog. Rept. 65, 1962. 
  4. [1] S. C. KLEENE, Representation of events in nerve nets, dans C. E. Shannon et J. McCarthy (ed.) « Automata Studies », pp. 3-40, Princeton University Press, Princeton, 1956. MR77478
  5. [1] S. Y. KURODA, Classes of languages and linear-bound automata. Information and Control, vol. 7, 1964, pp. 207-223. Zbl0199.04002MR169724
  6. [1] P. S. LANDWEBER, Three theorems on phrase structure grammars of type 1. Information and Control, vol. 6, 1963, pp. 131-136. Zbl0116.11702MR166011
  7. [1] J. MYHILL, Linear bounded automata. Wright Air Development Division. Tech. Note 60-165, 1960. 
  8. [1] M. O. RABIN et D. SCOTT, Finite automata and their decision problems. IBM J. Res. Develop., vol. 3, 1959, pp. 114-125. Zbl0158.25404MR103795

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.