Succinct representation of regular languages by boolean automata

Publisher Website

1 January 1981

journal article
Published by Elsevier in Theoretical Computer Science

Vol. 13 (3) , 323-330
https://doi.org/10.1016/s0304-3975(81)80005-9

Abstract

No abstract available

Keywords

This publication has 2 references indexed in Scilit:

On equations for regular languages, finite automata, and sequential networks
Theoretical Computer Science, 1980
On parallelism in turing machines
Published by Institute of Electrical and Electronics Engineers (IEEE) ,1976