Refining the Hierarchy of Blind Multicounter Languages

Authors:
Matthias Jantzen;Alexy Kurganskyy
Affiliations:
-;-
Venue:
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Year:
2001

Citing 4
Cited 0

Algebraic and Automata-Theoretic Properties of Formal Languages

Algebraic and Automata-Theoretic Properties of Formal Languages
On Twist-Closed Trios: A New Morphic Characterization of r.e. Sets

Foundations of Computer Science: Potential - Theory - Cognition, to Wilfried Brauer on the occasion of his sixtieth birthday
Hierarchies of Principal Twist-Closed Trios

STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Principal AFL

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that the families (k, r)-RBC of languages accepted (in quasi-realtime) by one-way counter automata having k blind counters of which r are reversal-bounded form a strict and linear hierarchy of semi-AFLs. This hierarchy comprises the families BLIND =M∩(C1) of blind multicounter languages with generator C1 := {w ∈ {a1, b1}*| |w|a1 = |w|b1} and RBC =M∩(B1) of reversal-bounded multicounter languages with generator B1 := {a1n b1n| n ∈ N}. This generalizes and sharpens the known results from [Grei 78] and [Jant 98].