Le cylindre des langages linéaires-Reference-Cited by-同舟云学术

Le cylindre des langages linéaires

Published:1977-12 Issue:1 Volume:11 Page:147-155
ISSN:0025-5661
Container-title:Mathematical Systems Theory
language:fr
Short-container-title:Math. Systems Theory

Author:

Boasson L.,Nivat M.

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science,Computational Theory and Mathematics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF01768473.pdf

Reference9 articles.

1. J. M. Autebert, Le Cylindre des Langages à Compteur,à paraitre.

2. L. Boasson, Langages algèbriques, paires itérantes et transductions rationnelles,T.C.S. 2 (1976), 209–223.

3. L. Boasson etM. Nivat, Sur diverses familles de langages fermées par transductions rationnelles,Acta Informatica 2 (1973), 180–188.

4. S. Ginsburg, TheMathematical Theory of Context-Free Languages, McGraw-Hill, 1966.

5. S. Ginsburg, J. Goldstine andS. Greibach, Uniformly erasable AFL,J.C.S.S. 10 (1975), 165–182.

Cited by 17 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The hardest language for grammars with context operators;Theoretical Computer Science;2023-05

2. The Hardest LL(k) Language;International Journal of Foundations of Computer Science;2023-02

3. On hardest languages for one-dimensional cellular automata;Information and Computation;2022-03

4. The Hardest LL(k) Language;Developments in Language Theory;2021

5. On Hardest Languages for One-Dimensional Cellular Automata;Language and Automata Theory and Applications;2021