The complexity of equivalence problems for commutative grammars

Authors:
Dung T. Huynh
Affiliations:
Iowa State Univ., Ames
Venue:
Information and Control - The MIT Press scientific computation series
Year:
1985

Citing 0
Cited 4

On axioms for commutative regular equations without addition

Theoretical Computer Science
Grammars as Processes

Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
Grammars as processes

Formal and natural computing
Detection of corrupted schema mappings in XML data integration systems

ACM Transactions on Internet Technology (TOIT)

Quantified Score

Hi-index	0.01

Visualization

Abstract