O. Ibarra. Reversal-bounded multicounter machines and their decision problems. Journal of the ACM, 25(1):116-- 133, 1978. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Masarykova univerzita v Brn e - Rodov Edeck Fakulta (Correct)
....of trace monoids comes from the theory of concurrent systems since they arise when simulations of these systems are considered. For most of the fundamental decision problems about rational trace languages a characterization of the monoids where these problems are decidable was already established [25, 2, 6, 21, 35, 1, 36] (for an overview see e.g. 15] A lot of work has been done also in the study of trace codings, but the status of decision problems of trace codings turned out to be more complicated. The first task concerning trace codings is to give an effective procedure for deciding whether a given morphism ....
O.H. Ibarra, Reversal-bounded multicounter machines and their decision problems, J. ACM 25(1) (1978) 116--133.
A Unified Approach to Hardware Verification through Heterogeneous .. - Fisler (1996) (8 citations) (Correct)
....Transitions are based on the current state, the letter being read, and whether each counter contains zero; the transition indicates a next state, which direction, if any, to move the input head, and whether to increment, decrement, or hold each counter. The formal definition is reproduced from [47]. Definition 94 1. A two way k counter machine M is a tuple hk; K; Sigma; ffi; q 0 ; F i where K, Sigma, q 0 , and F are the states, inputs, left and right endmarkers, initial state, and accepting states, respectively. ffi is a mapping from K Theta ( Sigma [f ; g) Theta f0; ....
Oscar H. Ibarra. Reversal-bounded multicounter machines and their decision problems. Journal of the ACM, 25(1):116--133, January 1978.
Parikh Automata and Monadic Second-Order Logics with Linear.. - Klaedtke, Rueß (2002) (5 citations) (Correct)
....this subsection, we compare some of them to Parikh automata. Parikh automata can be seen as automata extended with counters, where a vector of natural numbers attached to a symbol is interpreted as an increment of the counters. In contrast to other counter automata models in the literature, e.g. [8, 13, 15], we do not restrict the applicability of transitions in a run by additional guards on the values of the counters. Instead, a Parikh automaton constrains the language of an automaton over the extended alphabet with a Presburger arithmetic formula. It turns out that Parikh word automata are as ....
....a run by additional guards on the values of the counters. Instead, a Parikh automaton constrains the language of an automaton over the extended alphabet with a Presburger arithmetic formula. It turns out that Parikh word automata are as expressive as Ibarra s reversal bounded multicounter machines [15]. Ibarra s [15] reversal bounded multicounter machines are two way automata augmented with counters, where the reversals of the movement of the input head, and the reversals of decrement and increment of the counters are bounded. Property 8. Reversal bounded multicounter machines and Parikh ....
[Article contains additional citation context not shown here]
O. Ibarra, Reversal-bounded multicounter machines and their decision problems, Journal of the ACM, 25 (1978), pp. 116-133.
Parikh Automata and Monadic Second-Order Logics with Linear.. - Klaedtke, Rueß (2002) (5 citations) (Correct)
....linear polynomials. A Parikh nite word automata (PFWA) can be seen as a nite word automaton extended with counters, where a vector of natural numbers attached to a symbol is interpreted as an increment of the counters. In contrast to other counter automata models in the literature, for example [7, 12, 16], we do not restrict the applicability of transitions in a run by additional guards on the values of the counters. Instead, a PFWA constrains the language of a nite word automaton over the extended alphabet by a semi linear set. Parikh nite word (tree) automata characterize the expressiveness of ....
....of Parikh Automata to other Automata Models A PFWA can be seen as a nite word automaton extended with counters, where a vector of natural numbers attached to a symbol is interpreted as an increment of the counters. In contrast to other counter automata models in the literature, for example [7, 12,16], we do not restrict the applicability of transitions in a run by additional guards on the values of the counters. Instead, a PFWA constrains the language of a nite word automaton over the extended alphabet by a semilinear set. It turns out that PFWAs are as expressive as Ibarra s ....
[Article contains additional citation context not shown here]
O. Ibarra, Reversal-bounded multicounter machines and their decision problems, JACM, 25 (1978), pp. 116-133.
Binary Reachability Analysis of Discrete Pushdown.. - Dang, Ibarra, Bultan, .. (2000) (6 citations) Self-citation (Ibarra) (Correct)
No context found.
O. H. Ibarra, "Reversal-bounded multicounter machines and their decision problems, " J. ACM, 25 (1978) 116-133
Composability of Infinite-State Activity Automata - Dang, Ibarra, Su Self-citation (Ibarra) (Correct)
No context found.
O. H. Ibarra. Reversal-bounded multicounter machines and their decision problems. Journal of the ACM, 25(1):116--133, January 1978.
On Two-Way FA with Monotonic Counters and Quadratic.. - Ibarra, Dang Self-citation (Ibarra) (Correct)
No context found.
O. H. Ibarra. Reversal-bounded multicounter machines and their decision problems. Journal of the ACM, 25(1):116-- 133, January 1978.
Catalytic P Systems, Semilinear Sets, - And Vector Addition Self-citation (Ibarra) (Correct)
No context found.
O. H. Ibarra. Reversal-bounded multicounter machines and their decision problems. Journal of the ACM, 25(1):116--133, 1978.
Dense Counter Machines and Verification Problems - Xie, Dang, Ibarra, Pietro Self-citation (Ibarra) (Correct)
No context found.
O. H. Ibarra. Reversal-bounded multicounter machines and their decision problems. Journal of the ACM, 25(1):116--133, January 1978.
A Matrix q-Analogue of the Parikh Map - Egecioglu, Ibarra (2004) Self-citation (Ibarra) (Correct)
No context found.
Ibarra, O.: Reversal-bounded multicounter machines and their decision problems. J. Assoc. Comput. Mach., 24 (1978) 123-137.
Counter Machines: Decidable Properties and.. - Ibarra, Su, Dang.. (2000) (5 citations) Self-citation (Ibarra) (Correct)
....counter machines even over a unary input alphabet. On binary inputs, if one restricts the counter machines to make only a finite number of turns on the input tape, the emptiness problem is also undecidable, even for the case when the input head makes only one turn (i.e. change in direction) [9]. However, for one way counter machines, it is known that the equivalence (hence also the emptiness) problem is decidable, but the containment and disjointness problems are undecidable [14] In this paper, we study two way finite automata augmented with finitely many counters. A restricted ....
....it is known that the equivalence (hence also the emptiness) problem is decidable, but the containment and disjointness problems are undecidable [14] In this paper, we study two way finite automata augmented with finitely many counters. A restricted version of these machines was studied in [9], where: i) each counter is reversal bounded in that it can be incremented or decremented by 1 and tested for zero, but the number of times it can change mode from nondecreasing to nonincreasing and vice versa is bounded by a constant, and ii) the two way input is finite crossing in that the ....
[Article contains additional citation context not shown here]
O. H. Ibarra. "Reversal-bounded multicounter machines and their decision problems," J. ACM, 25:116-133, 1978.
Counter Machines and Verification Problems - Ibarra, Su, Dang, Bultan.. (2001) Self-citation (Ibarra) (Correct)
....counter machines even over a unary input alphabet. On binary inputs, if one restricts the counter machines to make only a finite number of turns on the input tape, the emptiness problem is also undecidable, even for the case when the input head makes only one turn (i.e. change in direction) [Iba78]. However, for one way counter machines, it is known that the equivalence (hence also the emptiness) problem is decidable, but the containment and disjointness problems are undecidable [VP75] In this paper, we study two way finite automata augmented with several counters. A restricted version of ....
....machines, it is known that the equivalence (hence also the emptiness) problem is decidable, but the containment and disjointness problems are undecidable [VP75] In this paper, we study two way finite automata augmented with several counters. A restricted version of these machines was studied in [Iba78]. Since a counter can be incremented decremented by 1 (and tested if it is 0) we count each alternation from non increasing mode to nondecreasing mode or viceversa as a reversal. For k; m; r 2 N (the natural numbers) we define an m crossing r reversal k counter machine M as a two way finite ....
[Article contains additional citation context not shown here]
O. H. Ibarra, Reversal-bounded multicounter machines and their decision problems, J. ACM, 25:116--133, 1978.
On the Emptiness Problem for Two-Way NFA with One.. - Dang, Ibarra, Sun (2002) Self-citation (Ibarra) (Correct)
.... automata augmented with one reversal bounded counter (i.e. the counter alternates between nondecreasing and nonincreasing modes a fixed number of times) operating on bounded languages (i.e. subsets of w k for some nonnull words w1 ; wk ) is decidable, settling an open problem in [11, 12]. The proof is a rather involved reduction to the solution of a special class of Diophantine systems of degree 2 via a class of programs called two phase programs. The result has applications to verification of infinite state systems. 1 Introduction Automata theory tries to answer questions ....
....work by Oscar H. Ibarra has been supported in part by NSF Grant IIS 0101134. Corresponding author (zdang eecs.wsu.edu) the machines to make only a finite number of turns on the input tape, the emptiness problem is still undecidable, even for the case when the input head makes only one turn [11]. However, for such machines with one way input, the emptiness problem is decidable, since they are simply pushdown automata with a unary stack alphabet. Restricting the operation of the counter in a two way one counter machine makes the emptiness problem decidable for some classes. For example, ....
[Article contains additional citation context not shown here]
O. H. Ibarra. Reversal-bounded multicounter machines and their decision problems. Journal of the ACM, 25(1):116--133, January 1978.
Generalized Discrete Timed Automata: Decidable.. - Dang, Ibarra, Kemmerer (2003) Self-citation (Ibarra) (Correct)
....x i has value v i 2 N for i = 1; 2; k. Similar to ;A , the binary reachability ;M of M is defined as all the pairs ( of configurations of M such that can reach . It is known that the emptiness problem for reversal bounded NCMs (when used as language recognizers) is decidable [18]. When a reversal bounded NCM uses linear relations as tests instead of using standard tests, we have the following result. Theorem 5. Suppose M is a nondeterministic strong reversal bounded multicounter machine without input tape that uses linear relations (on the counters and parameterized ....
....used as language recognizers, have a one way input tape. Suppose a two way input is used instead. Let 2DCM(c; r) denote the class of deterministic machines with a two way input tape and c r reversal bounded counters. Then the emptiness problem for 2DCM(c; r) when c 2 and r 1 is undecidable [18]. An interesting special case is when c = 1, i.e. there is only one counter. A language is 2DCM recognizable if it can be accepted by a 2DCM(1; r) Theorem 6. The emptiness problem for 2DCM recognizable languages is decidable [19] It is still open whether Theorem 6 holds for nondeterministic ....
O. H. Ibarra, "Reversal-bounded multicounter machines and their decision problems," J. ACM, 25 (1978) 116-133
On the freeze quantifier in constraint LTL: decidability.. - Demri, Lazic, Nowak (2005) (Correct)
No context found.
O. Ibarra. Reversal-bounded multicounter machines and their decision problems. Journal of the ACM, 25(1):116-- 133, 1978.
On the freeze quantifier in constraint LTL: decidability.. - Demri, Lazic, Nowak (2005) (Correct)
No context found.
O. Ibarra. Reversal-bounded multicounter machines and their decision problems. Journal of the ACM, 25(1):116-- 133, 1978.
Automatic Verification of Recursive Procedures with one .. - Bouajjani, Habermehl.. (2002) (Correct)
No context found.
O. Ibarra. Reversal-bounded multicounter machines and their decision problems. Journal of the ACM, 25:116-133, 1978.
Automatic Verification of Recursive Procedures with one .. - Bouajjani, Habermehl.. (2001) (Correct)
No context found.
O. Ibarra. Reversal-bounded multicounter machines and their decision problems. Journal of the ACM, 25:116--133, 1978.
Testability of Oracle Automata (Extended Abstract) - Xie, Li, Dang (Correct)
No context found.
O. H. Ibarra. Reversal-bounded multicounter machines and their decision problems. Journal of the ACM, 25(1):116--133, January 1978.
Characterizations of Catalytic Membrane - Computing Systems Extended (Correct)
No context found.
O. H. Ibarra. Reversal-bounded multicounter machines and their decision problems. Journal of the ACM, 25(1):116--133, January 1978.
Patterns - Salomaa (2003) (Correct)
No context found.
O. Ibarra, Reversal-bounded multicounter machines and their decision problems. Journal of the ACM 25 (1978) 116--133.
A q-Matrix Encoding Extending the Parikh Matrix Mapping - Egecioglu (2004) (Correct)
No context found.
Ibarra, O.: Reversal-bounded multicounter machines and their decision problems. J. Assoc. Comput. Mach., 24 (1978) 123-137.
A q-Matrix Encoding Extending the Parikh Matrix Mapping - Egecioglu (2004) (Correct)
No context found.
Ibarra, O.: Reversal-bounded multicounter machines and their decision problems. J. Assoc. Comput. Mach., 24 (1978) 123-137.
Automatic Verification of Recursive Procedures with one .. - Bouajjani, Habermehl.. (2001) (Correct)
No context found.
O. Ibarra. Reversal-bounded multicounter machines and their decision problems. Journal of the ACM, 25:116--133, 1978.
Automatic Verification of Recursive Procedures with one .. - Bouajjani, Habermehl.. (2002) (Correct)
No context found.
O. Ibarra. Reversal-bounded multicounter machines and their decision problems. Journal of the ACM, 25:116-133, 1978.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC