Programmable finite automata for VLSI

We describe a method VLSI for design of programmable finite automata. For any fixed k it can be programmed to deterministically simulate a non-deterministic finite auto- maton with at most k states. For some constant c it runs in time on inputs of length n>b and in time on inputs of length n≧b wh...

Full description

Saved in:
Bibliographic Details
Published in:International journal of computer mathematics Vol. 14; no. 3-4; pp. 259 - 275
Main Authors: Culik, K., Jürgensen, H.
Format: Journal Article
Language:English
Published: Abingdon Gordon and Breach Science Publishers 01.01.1983
Taylor and Francis
Subjects:
Applied sciences
Automata. Abstract machines. Turing machines
B.7.1 [Integrated Circuits]
Computer science; control theory; systems
Exact sciences and technology
F.1.1 [Computation by Abstract Devices]
F.4.3. [Mathematical Logic and Formal Languages]
Formal Languages-Regular Sets
Models of Computation-Finite Automata
Non-deterministic finite automata
Theoretical computing
Types and Design Styles-Algorithms Implemented in Hardware
VLSI
VLSI-tree
Programmable automaton
Finite automaton
Regular language
Tree(graph)
VLSI circuit
Automaton synthesis
ISSN:0020-7160, 1029-0265
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We describe a method VLSI for design of programmable finite automata. For any fixed k it can be programmed to deterministically simulate a non-deterministic finite auto- maton with at most k states. For some constant c it runs in time on inputs of length n>b and in time on inputs of length n≧b where b is a constant influencing the size of the realisation, which can be chosen so that ck is much smaller than b. The design is modular, it consists of 0(bk 2 ) identical processes connected in a uniform manner.
ISSN:0020-7160
1029-0265
DOI:10.1080/00207168308803390