×
Čulik, Karel II; Jürgensen, H.

Programmable finite automata for VLSI. (English) Zbl 0528.68035

Int. J. Comput. Math. 14, 259-275 (1983).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0528.68035

Cited in 5 Documents

MSC:

68Q45 Formal languages and automata

Keywords:

design of programmable finite automata; non-deterministic finite automaton; VLSI-tree
PDF BibTeX XML Cite
\textit{K. Čulik II} and \textit{H. Jürgensen}, Int. J. Comput. Math. 14, 259--275 (1983; Zbl 0528.68035)
Full Text: DOI
  • logo of hbz
  • logo of WorldCat

References:

[1] Foster M.J., VLSI pp 75– (1981)
[2] Floyd R.W., JACM 29 pp 603– (1982) · Zbl 0485.68047
[3] Culik A., RAIRO (1983)
[4] Culik K., Acta Informatica 18 pp 335– (1983) · Zbl 0493.68054
[5] Mead C., Introduction to VLSI Systems (1980)
[6] Mukhopadhyay A., IEEE Trans on Computers 28 pp 384– (1979) · Zbl 0403.68035
[7] Starke P.H., Abstrakte Automaten (1969)
[8] Culik, K. II and Pachl, J. Folding and unrolling systolic arrays. Proc. ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing. pp.254–261. Fasc.
[9] Salomaa A., Automata-Theoretic Aspects of Formal Power Series (1978) · Zbl 0377.68039
[10] Steinby M., Theoretical Computer Science 22 pp 219– (1983) · Zbl 0501.68046
[11] Aho A.V., Formal Language Theory pp 325– (1980)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.