Characterizations of transductions defined by abstract families of transducers-Reference-Cited by-同舟云学术

Characterizations of transductions defined by abstract families of transducers

Published:1971-09 Issue:3 Volume:5 Page:271-281
ISSN:0025-5661
Container-title:Mathematical Systems Theory
language:en
Short-container-title:Math. Systems Theory

Author:

Ibarra Oscar H.

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

Reference15 articles.

1. A. V. Aho, J. E. Hopcroft, andJ. D. Ullman, A general theory of translations,Math. Systems Theory 3 (1969), 193–221.

2. A. V. Aho andJ. D. Ullman, A characterization of two-way deterministic classes of languages,IEEE Conference Record of 1969 Tenth Annual Symposium on Switching Automata Theory, pp. 231–239.

3. W. J. Chandler, Abstract families of deterministic languages,Proc. ACM Symposium on Theory of Computing, pp. 21–30, Marina del Rey, California, 1969.

4. J. E. Hopcroft andJ. D. Ullman, An approach to a unified theory of automata,Bell System Tech. J. 46 (1967), 1793–1829.

5. C. C. Elgot andJ. E. Mezei, On relations defined by generalized finite automata,IBM J. Res. Develop. 9 (1965), 47–68.

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

1. Regular prefix relations;Mathematical Systems Theory;1984-12

2. Space classes, intersection of languages and bounded erasing homomorphisms;RAIRO. Informatique théorique;1983

3. Classes of formal grammars;Journal of Soviet Mathematics;1976-08