The Computational Complexity of PCGS with Regular Components.
Year: 1995
Type: conference-paper
Source: Developments in Language Theory
Author: Liming Cai
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: closed
OpenAlex ID: W48422839
