Succinct representation of regular languages by boolean automata
Work
Year: 1981
Type: article
Source: Theoretical Computer Science
Author Ernst L. Leiss
Institution University of Kentucky
Cites: 5
Cited by: 152
Related to: 10
FWCI: 0.552
Citation percentile (by year/subfield): 94.61
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Sustainable Development Goal Quality education
Open Access status: bronze