CHARACTERIZATIONS OF BOUNDED SEMILINEAR LANGUAGES BY ONE-WAY AND TWO-WAY DETERMINISTIC MACHINES

2012 ◽  
Vol 23 (06) ◽  
pp. 1291-1305 ◽  
Author(s):  
OSCAR H. IBARRA ◽  
SHINNOSUKE SEKI
Keyword(s):  
Bounded Language ◽  
Counter Machines

A bounded language [Formula: see text] (for some k ≥ 1 and not-necessarily distinct nonempty words x1, …, xk) is bounded semilinear if the set [Formula: see text] is semilinear. We give characterizations of bounded semilinear languages in terms of one-way and two-way deterministic counter machines.

scholarly journals Simple counter machines and number-theoretic problems

1979 ◽  
Vol 19 (2) ◽  
pp. 145-162 ◽  
Author(s):  
Eitan M. Gurari ◽  
Oscar H. Ibarra
Keyword(s):  
Counter Machines

scholarly journals One-Reversal Counter Machines and Multihead Automata: Revisited

2011 ◽  
pp. 166-177 ◽  
Author(s):  
Ehsan Chiniforooshan ◽  
Mark Daley ◽  
Oscar H. Ibarra ◽  
Lila Kari ◽  
Shinnosuke Seki
Keyword(s):  
Counter Machines

Equivalence problem for finitely iterated counter machines

Cybernetics ◽  
1981 ◽  
Vol 16 (4) ◽  
pp. 486-488
Author(s):  
V. N. Red'ko ◽  
L. P. Lisovik
Keyword(s):  
Equivalence Problem ◽  
Counter Machines

Small Universal Reversible Counter Machines

2018 ◽  
pp. 433-446
Author(s):  
Artiom Alhazov ◽  
Sergey Verlan ◽  
Rudolf Freund
Keyword(s):  
Counter Machines

scholarly journals Dense-choice Counter Machines revisited

2014 ◽  
Vol 542 ◽  
pp. 17-31
Author(s):  
Florent Bouchy ◽  
Alain Finkel ◽  
Pierluigi San Pietro
Keyword(s):  
Counter Machines

Counter machines and counter languages

1968 ◽  
Vol 2 (3) ◽  
pp. 265-283 ◽  
Author(s):  
Patrick C. Fischer ◽  
Albert R. Meyer ◽  
Arnold L. Rosenberg
Keyword(s):  
Counter Machines
Sign in / Sign up

Export Citation Format

Share Document