Programmable finite automata for VLSI†

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

zbMATH Keywords

design of programmable finite automatanon-deterministic finite automatonVLSI-tree

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

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

• Unnamed Item
• Systolic automata for VLSI on balanced trees
• Systolic trees and systolic language recognition by tree automata
• The Compilation of Regular Expressions into Integrated Circuits
• Hardware Algorithms for Nonnumeric Computation

This page was built for publication: Programmable finite automata for VLSI†