The family of one-counter languages is closed under quotient

Authors:
M. Latteux;B. Leguy;B. Ratoandromanana
Affiliations:
Univ. de Lille I, Villeneuve d`Ascq, France;Univ. de Lille I, Villeneuve d`Ascq, France;Univ. de Lille I, Villeneuve d`Ascq, France
Venue:
Acta Informatica
Year:
1985

Citing 0
Cited 4

Upper Bounds for Restricted Splicing

Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
Upper bounds for restricted splicing

Formal and natural computing
One-Turn Regulated Pushdown Automata and Their Reduction

Fundamenta Informaticae
One-Turn Regulated Pushdown Automata and Their Reduction

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract