passa ai contenuti
The Compilation of Regular Expressions into Integrated Circuits. Anteprima di questo documento
ChiudiAnteprima di questo documento
Stiamo controllando…

The Compilation of Regular Expressions into Integrated Circuits.

Autore: Robert W Floyd; Jeffrey D Ullman; STANFORD UNIV CA DEPT OF COMPUTER SCIENCE.
Editore: Ft. Belvoir Defense Technical Information Center APR 1980.
Edizione/Formato:   book_printbook : EnglishVedi tutte le edizioni e i formati
Banca dati:WorldCat
Sommario:
We consider the design of integrated circuits to implement arbitrary regular expressions. In general, we may use the McNaughton-Yamada algorithm to convert a regular expression of length n into a nondeterministic finite automation with at most 2n states and 4n transitions. Instead of converting the nondeterministic device to a deterministic one, we propose two ways of implementing the nondeterministic device  Per saperne di più…
Voto:

(non ancora votato) 0 con commenti - Diventa il primo.

Soggetti
Altri come questo

 

Trova una copia in biblioteca

&AllPage.SpinnerRetrieving; Stiamo ricercando le biblioteche che possiedono questo documento…

Dettagli

Tipo documento: Book
Tutti gli autori / Collaboratori: Robert W Floyd; Jeffrey D Ullman; STANFORD UNIV CA DEPT OF COMPUTER SCIENCE.
Numero OCLC: 227463743
Descrizione: 3 p.

Abstract:

We consider the design of integrated circuits to implement arbitrary regular expressions. In general, we may use the McNaughton-Yamada algorithm to convert a regular expression of length n into a nondeterministic finite automation with at most 2n states and 4n transitions. Instead of converting the nondeterministic device to a deterministic one, we propose two ways of implementing the nondeterministic device directly. First, we could produce a PLA (programmable logic array) of approximate dimensions 4n x 4n by representing the states directly by columns, rather than coding the states in binary. This approach, while theoretically suboptimal, makes use of carefully developed technology and, because of the care with which PLA implementation has been done, may be the preferred technique in many real situations. Another approach is to use the hierarchical structure of the automation produced from the regular expression to guide a hierarchical layout of the circuit. This method produces a circuit 0(square root of n) on a side and is, to within a constant factor, the best that can be done in general. (Author).

Commenti

Commenti degli utenti
Recuperando commenti GoodReads…
Stiamo recuperando commenti DOGObooks

Etichette

Diventa il primo.
Conferma questa richiesta

Potresti aver già richiesto questo documento. Seleziona OK se si vuole procedere comunque con questa richiesta.

Dati collegati


Primary Entity

<http://www.worldcat.org/oclc/227463743> # The Compilation of Regular Expressions into Integrated Circuits.
    a schema:Book, schema:CreativeWork ;
   library:oclcnum "227463743" ;
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/vau> ;
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/10640625#Place/ft_belvoir> ; # Ft. Belvoir
   schema:about <http://experiment.worldcat.org/entity/work/data/10640625#Thing/pla_programmable_logic_arrays> ; # PLA(Programmable Logic Arrays)
   schema:about <http://experiment.worldcat.org/entity/work/data/10640625#Thing/circuit_layouts> ; # Circuit layouts
   schema:about <http://experiment.worldcat.org/entity/work/data/10640625#Topic/computer_programming> ; # Computer programming
   schema:about <http://experiment.worldcat.org/entity/work/data/10640625#Topic/integrated_circuits> ; # Integrated circuits
   schema:about <http://experiment.worldcat.org/entity/work/data/10640625#Topic/electrical_and_electronic_equipment> ; # Electrical and Electronic Equipment
   schema:about <http://experiment.worldcat.org/entity/work/data/10640625#Topic/theoretical_mathematics> ; # Theoretical Mathematics
   schema:about <http://experiment.worldcat.org/entity/work/data/10640625#Topic/equivalent_circuits> ; # Equivalent circuits
   schema:about <http://experiment.worldcat.org/entity/work/data/10640625#Topic/square_roots> ; # Square roots
   schema:about <http://experiment.worldcat.org/entity/work/data/10640625#Topic/hierarchies> ; # Hierarchies
   schema:about <http://experiment.worldcat.org/entity/work/data/10640625#Topic/length> ; # Length
   schema:about <http://experiment.worldcat.org/entity/work/data/10640625#Thing/unary_counters> ; # Unary counters
   schema:about <http://experiment.worldcat.org/entity/work/data/10640625#Thing/actual_to_logical_interpreters> ; # Actual to logical interpreters
   schema:about <http://experiment.worldcat.org/entity/work/data/10640625#Thing/strings_empty> ; # Strings(Empty)
   schema:about <http://experiment.worldcat.org/entity/work/data/10640625#Thing/regular_expressions> ; # Regular expressions
   schema:about <http://experiment.worldcat.org/entity/work/data/10640625#Topic/automation> ; # Automation
   schema:about <http://experiment.worldcat.org/entity/work/data/10640625#Topic/solid_state_physics> ; # Solid State Physics
   schema:about <http://experiment.worldcat.org/entity/work/data/10640625#Topic/coding> ; # Coding
   schema:about <http://experiment.worldcat.org/entity/work/data/10640625#Topic/circuit_analysis> ; # Circuit analysis
   schema:about <http://experiment.worldcat.org/entity/work/data/10640625#Topic/silicon> ; # Silicon
   schema:about <http://experiment.worldcat.org/entity/work/data/10640625#Topic/algorithms> ; # Algorithms
   schema:about <http://experiment.worldcat.org/entity/work/data/10640625#Thing/mcnaughton_yamada_algorithm> ; # McNaughton Yamada algorithm
   schema:about <http://experiment.worldcat.org/entity/work/data/10640625#Topic/logic_circuits> ; # Logic circuits
   schema:about <http://experiment.worldcat.org/entity/work/data/10640625#Topic/arrays> ; # Arrays
   schema:about <http://experiment.worldcat.org/entity/work/data/10640625#Thing/nfa_nondeterministic_finite_automation> ; # NFA(Nondeterministic Finite Automation)
   schema:about <http://experiment.worldcat.org/entity/work/data/10640625#Thing/complements_mathematics> ; # Complements(Mathematics)
   schema:bookFormat bgn:PrintBook ;
   schema:contributor <http://experiment.worldcat.org/entity/work/data/10640625#Person/ullman_jeffrey_d> ; # Jeffrey D. Ullman
   schema:contributor <http://experiment.worldcat.org/entity/work/data/10640625#Organization/stanford_univ_ca_dept_of_computer_science> ; # STANFORD UNIV CA DEPT OF COMPUTER SCIENCE.
   schema:contributor <http://experiment.worldcat.org/entity/work/data/10640625#Person/floyd_robert_w> ; # Robert W. Floyd
   schema:datePublished "APR 1980" ;
   schema:datePublished "1980" ;
   schema:description "We consider the design of integrated circuits to implement arbitrary regular expressions. In general, we may use the McNaughton-Yamada algorithm to convert a regular expression of length n into a nondeterministic finite automation with at most 2n states and 4n transitions. Instead of converting the nondeterministic device to a deterministic one, we propose two ways of implementing the nondeterministic device directly. First, we could produce a PLA (programmable logic array) of approximate dimensions 4n x 4n by representing the states directly by columns, rather than coding the states in binary. This approach, while theoretically suboptimal, makes use of carefully developed technology and, because of the care with which PLA implementation has been done, may be the preferred technique in many real situations. Another approach is to use the hierarchical structure of the automation produced from the regular expression to guide a hierarchical layout of the circuit. This method produces a circuit 0(square root of n) on a side and is, to within a constant factor, the best that can be done in general. (Author)."@en ;
   schema:exampleOfWork <http://worldcat.org/entity/work/id/10640625> ;
   schema:inLanguage "en" ;
   schema:name "The Compilation of Regular Expressions into Integrated Circuits."@en ;
   schema:numberOfPages "3" ;
   schema:productID "227463743" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/227463743#PublicationEvent/ft_belvoirdefense_technical_information_centerapr_1980> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/10640625#Agent/defense_technical_information_center> ; # Defense Technical Information Center
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/227463743> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/10640625#Agent/defense_technical_information_center> # Defense Technical Information Center
    a bgn:Agent ;
   schema:name "Defense Technical Information Center" ;
    .

<http://experiment.worldcat.org/entity/work/data/10640625#Organization/stanford_univ_ca_dept_of_computer_science> # STANFORD UNIV CA DEPT OF COMPUTER SCIENCE.
    a schema:Organization ;
   schema:name "STANFORD UNIV CA DEPT OF COMPUTER SCIENCE." ;
    .

<http://experiment.worldcat.org/entity/work/data/10640625#Person/floyd_robert_w> # Robert W. Floyd
    a schema:Person ;
   schema:familyName "Floyd" ;
   schema:givenName "Robert W." ;
   schema:name "Robert W. Floyd" ;
    .

<http://experiment.worldcat.org/entity/work/data/10640625#Person/ullman_jeffrey_d> # Jeffrey D. Ullman
    a schema:Person ;
   schema:familyName "Ullman" ;
   schema:givenName "Jeffrey D." ;
   schema:name "Jeffrey D. Ullman" ;
    .

<http://experiment.worldcat.org/entity/work/data/10640625#Thing/actual_to_logical_interpreters> # Actual to logical interpreters
    a schema:Thing ;
   schema:name "Actual to logical interpreters" ;
    .

<http://experiment.worldcat.org/entity/work/data/10640625#Thing/complements_mathematics> # Complements(Mathematics)
    a schema:Thing ;
   schema:name "Complements(Mathematics)" ;
    .

<http://experiment.worldcat.org/entity/work/data/10640625#Thing/mcnaughton_yamada_algorithm> # McNaughton Yamada algorithm
    a schema:Thing ;
   schema:name "McNaughton Yamada algorithm" ;
    .

<http://experiment.worldcat.org/entity/work/data/10640625#Thing/nfa_nondeterministic_finite_automation> # NFA(Nondeterministic Finite Automation)
    a schema:Thing ;
   schema:name "NFA(Nondeterministic Finite Automation)" ;
    .

<http://experiment.worldcat.org/entity/work/data/10640625#Thing/pla_programmable_logic_arrays> # PLA(Programmable Logic Arrays)
    a schema:Thing ;
   schema:name "PLA(Programmable Logic Arrays)" ;
    .

<http://experiment.worldcat.org/entity/work/data/10640625#Thing/regular_expressions> # Regular expressions
    a schema:Thing ;
   schema:name "Regular expressions" ;
    .

<http://experiment.worldcat.org/entity/work/data/10640625#Topic/computer_programming> # Computer programming
    a schema:Intangible ;
   schema:name "Computer programming"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/10640625#Topic/electrical_and_electronic_equipment> # Electrical and Electronic Equipment
    a schema:Intangible ;
   schema:name "Electrical and Electronic Equipment"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/10640625#Topic/equivalent_circuits> # Equivalent circuits
    a schema:Intangible ;
   schema:name "Equivalent circuits"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/10640625#Topic/integrated_circuits> # Integrated circuits
    a schema:Intangible ;
   schema:name "Integrated circuits"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/10640625#Topic/solid_state_physics> # Solid State Physics
    a schema:Intangible ;
   schema:name "Solid State Physics"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/10640625#Topic/theoretical_mathematics> # Theoretical Mathematics
    a schema:Intangible ;
   schema:name "Theoretical Mathematics"@en ;
    .


Content-negotiable representations

Chiudi finestra

Per favore entra in WorldCat 

Non hai un account? Puoi facilmente crearne uno gratuito.