Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages-Reference-Cited by-同舟云学术

Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages

Published:1980-07 Issue:3 Volume:27 Page:499-518
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Engelfriet J.¹,Rozenberg G.²

Affiliation:

1. Department of Applied Mathematics, Twente University of Technology, P.O. Box 217, 7500 AE Enschede, The Netherlands

2. Department of Mathematics, University of Antwerp UIA, B-2610 Wilrijk, Belgium

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Reference34 articles.

1. Indexed Grammars—An Extension of Context-Free Grammars

2. AHO A.V. AND ULLMAN J.n. A characterization of two-way deterministic classes of languages. ~ Comptr. Syst. Sci. d (1970) 523-538. AHO A.V. AND ULLMAN J.n. A characterization of two-way deterministic classes of languages. ~ Comptr. Syst. Sci. d (1970) 523-538.

3. Reversal-bounded muhipushdown machines. ~ Comptr;BAKER B.S.;SyJt. Sci.,1974

4. Comparisons and reset machines

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

1. On the difference set of two transductions;Theoretical Computer Science;2024-11

2. Unambiguous injective morphisms in free groups;Information and Computation;2022-11

3. Some Wonders of a Bio-Computer-Scientist;Annals of West University of Timisoara - Mathematics and Computer Science;2019-06-01

4. Undecidability and Finite Automata;Developments in Language Theory;2017

5. On Boolean Closed Full Trios and Rational Kripke Frames;Theory of Computing Systems;2016-07-25