Programmable finite automata for VLSI†
From MaRDI portal
Publication:3309068
DOI10.1080/00207168308803390zbMath0528.68035OpenAlexW2006225057MaRDI QIDQ3309068
Karel II Culik, Helmut Jürgensen
Publication date: 1983
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207168308803390
Related Items
Syntactic monoids in the construction of systolic tree automata, Power of interconnections and of nondeterminism in regularY-tree systolic automata, Succinctness of descriptions of SBTA-languages, Synthesis, structure and power of systolic computations, Topological transformations as a tool in the design of systolic networks
Cites Work