On the complexity of some extended word problems defined by cancellation rules
Work
Year: 1986
Type: article
Source: Information Processing Letters
Authors Michèle Benois, Jacques Sakarovitch
Institutions Université Paris Cité, Sorbonne Université
Cites: 9
Cited by: 21
Related to: 10
FWCI: 0.92
Citation percentile (by year/subfield): 84.76
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: closed