Context-free preserving functions-Reference-Cited by-同舟云学术

Context-free preserving functions

Published:1975-06 Issue:2 Volume:9 Page:193-197
ISSN:0025-5661
Container-title:Mathematical Systems Theory
language:en
Short-container-title:Math. Systems Theory

Author:

Kosaraju S. Rao

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/BF01704019.pdf

Reference8 articles.

1. S. Ginsburg,The Mathematical Theory of Context-free Languages, McGraw-Hill Book Co., 1966.

2. J. E. Hopcroft andJ. D. Ullman,Formal Languages and Their Relation to Automata, Addison-Wesley Publishing Co., 1969.

3. S. R. Kosaraju, Finite state automata with markers,Proc. Fourth Annual Princeton Conference on Information Sciences and Systems, 1970, p. 380.

4. S. R. Kosaraju, Regularity preserving functions, Tech. Report, JHU-EE 74-2, Johns Hopkins University, Electrical Engineering Dept., January 1974.

5. R. McNaughton, Personal Communication.

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

1. Operations preserving regular languages;Theoretical Computer Science;2006-04

2. Operations Preserving Recognizable Languages;Fundamentals of Computation Theory;2003

3. Averaging in dynamical systems and large deviations;Inventiones Mathematicae;1992-12

4. Parallel and two-way recognizers of directed acyclic graphs;Mathematical Foundations of Computer Science 1979;1979

5. Regularity-preserving relations;Theoretical Computer Science;1976