Indécidabilité de la condition IRS
RAIRO. Informatique théorique, Tome 16 (1982) no. 2, pp. 129-138. 
@article{ITA_1982__16_2_129_0,
     author = {Autebert, Jean-Michel and Beauquier, Joffroy and Boasson, Luc and Latteux, Michel},
     title = {Ind\'ecidabilit\'e de la condition {IRS}},
     journal = {RAIRO. Informatique th\'eorique},
     pages = {129--138},
     publisher = {EDP-Sciences},
     volume = {16},
     number = {2},
     year = {1982},
     mrnumber = {674924},
     zbl = {0493.68075},
     language = {fr},
     url = {http://archive.numdam.org/item/ITA_1982__16_2_129_0/}
}
TY  - JOUR
AU  - Autebert, Jean-Michel
AU  - Beauquier, Joffroy
AU  - Boasson, Luc
AU  - Latteux, Michel
TI  - Indécidabilité de la condition IRS
JO  - RAIRO. Informatique théorique
PY  - 1982
SP  - 129
EP  - 138
VL  - 16
IS  - 2
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/ITA_1982__16_2_129_0/
LA  - fr
ID  - ITA_1982__16_2_129_0
ER  - 
%0 Journal Article
%A Autebert, Jean-Michel
%A Beauquier, Joffroy
%A Boasson, Luc
%A Latteux, Michel
%T Indécidabilité de la condition IRS
%J RAIRO. Informatique théorique
%D 1982
%P 129-138
%V 16
%N 2
%I EDP-Sciences
%U http://archive.numdam.org/item/ITA_1982__16_2_129_0/
%G fr
%F ITA_1982__16_2_129_0
Autebert, Jean-Michel; Beauquier, Joffroy; Boasson, Luc; Latteux, Michel. Indécidabilité de la condition IRS. RAIRO. Informatique théorique, Tome 16 (1982) no. 2, pp. 129-138. http://archive.numdam.org/item/ITA_1982__16_2_129_0/

1.J. M. Autebert, G. Cousineau etM. Nivat, Les Langages Algébriques, Hermann, Paris (à paraître).

2. L. Boasson, Un LangageAlgébrique Particulier, R.A.I.R.O., Informatique théorique, vol. 13, 1979, p. 203-215. | Numdam | MR | Zbl

4. E. Friedmann, The Inclusion Problem for Simple Languages, Theoretical Computer Science, vol. 1, 1976, p. 297-316. | MR | Zbl

5. C. Frougny, Langages très Simples Générateurs, R.A.I.R.O., Informatique Théorique, vol. 13, 1976, p. 69-86. | Numdam | MR | Zbl

6. S. Ginsburg, The Mathematical Theory of Context-free Languages, Mc Graw Hill, 1966. | MR | Zbl

7. S. Ginsburg et E.H. Spanier, Finite-Turn Pushdown Automata, S.I.A.M. J. Control, vol. 4, 1966, p. 429-453. | MR | Zbl

8. S. A. Greibach, The Unsolvability of the Recognition of Linear Context-Free Languages, J. Assoc. Comp. Mach., vol. 13, 1966, p. 582-588. | MR | Zbl

9. S. A. Greibach, One-Counter Languages and the IRS Condition, J. Comput System Sc., vol. 10, 1975, p. 237-247. | MR | Zbl

10. S. A. Greibach et E. Friedmann, Superdeterministics Pda's : a Subcase with a Decidable Equivalence Problem (à paraître). | Zbl

11. M. Latteux, Cônes Rationnels Commutativement Clos, R.A.I.R.O., Informatique Théorique, vol. 11, 1977, p. 29-51. | Numdam | MR | Zbl

12. R. E. Stearns, A Regularity Test for Pushdown Machines, Information and Control, vol. 11, 1967, p. 323-340. | Zbl

13. L. G. Valiant, The Equivalence Problem for Deterministic Finite-Turn Pushdow Automata, Information and Control, vol. 25, 1974, p. 123-133. | MR | Zbl

14. L. G. Valiant, Decision Procedures for Families of Deterministic Pushdown Automata, Ph. D. Thesis, University of Warwick, 1973.