Termination and derivational complexity of confluent one-rule string-rewriting systems
Work
Year: 2001
Type: article
Source: Theoretical Computer Science
Institutions Toho University, Kyoto Sangyo University, Tenri University
Cites: 5
Cited by: 12
Related to: 10
FWCI: 3.295
Citation percentile (by year/subfield): 65.28
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Sustainable Development Goal Quality education
Open Access status: closed