Affine Parikh automata-Reference-Cited by-同舟云学术

Affine Parikh automata

Published:2012-08-02 Issue:4 Volume:46 Page:511-545
ISSN:0988-3754
Container-title:RAIRO - Theoretical Informatics and Applications
language:
Short-container-title:RAIRO-Theor. Inf. Appl.

Author:

Cadilhac Michaël,Finkel Alain,McKenzie Pierre

Publisher

EDP Sciences

Subject

Computer Science Applications,General Mathematics,Software

Link

http://www.rairo-ita.org/10.1051/ita/2012013/pdf

Reference27 articles.

1. Baker B.S. and Book R.V., Reversal-bounded multipushdown machines.J. Comput. Syst. Sci.8(1974) 315–332.

2. Blattner M. and Latteux M., Parikh-bounded languages, in ICALP.Lect. Notes Comput. Sci.115(1981) 316–323.

3. Book R., Nivat M. and Paterson M., Reversal-bounded acceptors and intersections of linear languages.SIAM J. Comput.3(1974) 283.

4. Brandenburg F., Analogies of PAL and COPY, in Fundamentals of Computation Theory.Lect. Notes in Comput. Sci.117(1981) 61–70.

5. E. Chiniforooshan, M. Daley, O.H. Ibarra, L. Kari and S. Seki, One-reversal counter machines and multihead automata : revisited, in Proc. ofSOFSEM. ACM (2011) 166–177.

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

1. Jumping Automata over Infinite Words;Theory of Computing Systems;2024-09-10

2. Unboundedness Problems for Machines with Reversal-Bounded Counters;Lecture Notes in Computer Science;2023

3. Jumping Automata over Infinite Words;Developments in Language Theory;2023

4. Synchronization of Parikh Automata;Developments in Language Theory;2023

5. The Complexity of Reachability in Affine Vector Addition Systems with States;Logical Methods in Computer Science;2021-07-20