AbstractThis paper investigates several properties of one-way alternating multicounter machines which operate in real time, and shows that (1) for each k⩾1, one-way alternating k-counter machines (1acm(k)'s) which operate in real time are less powerful than 1acm(k+1)'s which operate in real time, (2) for each k⩾2, 1acm(k)'s which operate in real time are less powerful than 1acm(k)'s which operate in linear time, and (3) for each k⩾1, the class of sets accepted by 1acm(k)'s which operate in real time is not closed under concatenation with regular sets, Kleene closure, reversal and length-preserving homomorphism
The computational power of 2-way pushodown acceptors with m(≥1) additional counters (called mC-PDA) ...
The classes of sequences generated by time- and space- restricted multiple counter machines are comp...
AbstractYamamoto and Noguchi raised the question of whether every recursively enumerable set can be ...
AbstractThis paper investigates the power of realtime one-way synchronized alternating one-counter a...
AbstractWe investigate the power of (1-reversal) counter machines (finite automata with multiple cou...
AbstractThe main result of this paper is that a pushdown automaton M augmented with R(n) reversal-bo...
AbstractOne-way two-counter machines represent a universal model of computation. Here we consider th...
Alternating Turing machines were introduced in [2] as a mechanism to model parallel computation, and...
AbstractIn this paper, we show that real time k-dimensional iterative arrays are equivalent through ...
AbstractWe define alternating multihead finite automata, a generalization of nondeterministic multih...
AbstractWe consider one-way nondeterministic machines which have counters allowed to hold positive o...
AbstractIt is proved that the family of languages recognized by one-way real-time nondeterministic m...
AbstractFor classes of languages accepted in polynomial time by multicounter machines, various trade...
AbstractThe alternating machine having a separate input tape with k two-way, read-only heads, and a ...
AbstractWe study the power of reversal-bounded ATMs (alternating Turing machines). The results obtai...
The computational power of 2-way pushodown acceptors with m(≥1) additional counters (called mC-PDA) ...
The classes of sequences generated by time- and space- restricted multiple counter machines are comp...
AbstractYamamoto and Noguchi raised the question of whether every recursively enumerable set can be ...
AbstractThis paper investigates the power of realtime one-way synchronized alternating one-counter a...
AbstractWe investigate the power of (1-reversal) counter machines (finite automata with multiple cou...
AbstractThe main result of this paper is that a pushdown automaton M augmented with R(n) reversal-bo...
AbstractOne-way two-counter machines represent a universal model of computation. Here we consider th...
Alternating Turing machines were introduced in [2] as a mechanism to model parallel computation, and...
AbstractIn this paper, we show that real time k-dimensional iterative arrays are equivalent through ...
AbstractWe define alternating multihead finite automata, a generalization of nondeterministic multih...
AbstractWe consider one-way nondeterministic machines which have counters allowed to hold positive o...
AbstractIt is proved that the family of languages recognized by one-way real-time nondeterministic m...
AbstractFor classes of languages accepted in polynomial time by multicounter machines, various trade...
AbstractThe alternating machine having a separate input tape with k two-way, read-only heads, and a ...
AbstractWe study the power of reversal-bounded ATMs (alternating Turing machines). The results obtai...
The computational power of 2-way pushodown acceptors with m(≥1) additional counters (called mC-PDA) ...
The classes of sequences generated by time- and space- restricted multiple counter machines are comp...
AbstractYamamoto and Noguchi raised the question of whether every recursively enumerable set can be ...