BOUNDED PARIKH AUTOMATA-Reference-Cited by-同舟云学术

BOUNDED PARIKH AUTOMATA

Published:2012-12 Issue:08 Volume:23 Page:1691-1709
ISSN:0129-0541
Container-title:International Journal of Foundations of Computer Science
language:en
Short-container-title:Int. J. Found. Comput. Sci.

Author:

CADILHAC MICHAËL¹,FINKEL ALAIN²,MCKENZIE PIERRE¹

Affiliation:

1. Laboratoire d’informatique théorique et quantique, Département d’informatique et de recherche opérationnelle, Université de Montréal, C.P. 6128 succursale Centre-ville, Montréal (Québec) H3C 3J7, Canada

2. LSV, ENS Cachan, CNRS, 61 av. du Président Wilson, F-94230 Cachan, France

Abstract

The Parikh finite word automaton model (PA) was introduced and studied by Klaedtke and Rueß. Here, we present some expressiveness properties of a restriction of the deterministic affine PA recently introduced, and use them as a tool to show that the bounded languages recognized by PA are the same as those recognized by deterministic PA. Moreover, this class of languages is shown equal to the class of bounded languages with a semilinear iteration set.

Publisher

World Scientific Pub Co Pte Lt

Subject

Computer Science (miscellaneous)

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0129054112400709

Reference13 articles.

1. Adding nesting structure to words

2. Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations

3. Model-checking CTL* over flat Presburger counter systems

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

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

2. Verifying Unboundedness via Amalgamation;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08

3. Techniques for Showing the Decidability of the Boundedness Problem of Language Acceptors;Lecture Notes in Computer Science;2024

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

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