Non-prinicipalité du cylindre des langages à compteur-Reference-Cited by-同舟云学术

Non-prinicipalité du cylindre des langages à compteur

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

Author:

Autebert J. -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/BF01768474.pdf

Reference11 articles.

1. L. Boasson, Two iteration theorems for some families of languages,J. of Computer and System Sciences 7 (1973), 583–596.

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

3. L. Boasson etM. Nivat, Le cylindre des langages linéaires n'est pas principal,Lecture Notes in Computer Science 33 (1975), 16–19.

4. P. C. Ficher, A. R. Meyer, etRosenberg, Counter machines and counter languages,Math. System Theory 2 (1968), 265–283.

5. S. Ginsburg,The Mathematical Theory of Context-free Languages, McGraw-Hill, New York, 1966.

Cited by 20 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