Automatic And Polynomial Time Algebraic Structures
Work
Year: 2019
Type: article
Abstract: A structure is automatic if its domain, functions, and relations are all regular languages. Using the fact that every automatic structure is decidable, in the literature many decision problems have b... more
Source: Journal of Symbolic Logic
Authors Nikolay Bazhenov, Matthew Harrison‐Trainor, I. Sh. Kalimullin, Alexander Melnikov, Keng Meng Ng
Institutions Sobolev Institute of Mathematics, University of Waterloo, Kazan Federal University, Massey University, Nanyang Technological University
Cites: 63
Cited by: 26
Related to: 10
FWCI: 3.134
Citation percentile (by year/subfield): 89.93
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Sustainable Development Goal Peace, justice, and strong institutions
Open Access status: green