Automata Implementation First International Workshop on Implementing Automata, WIA '96, London, Ontario, Canada, August 29 - 31, 1996, Revised Papers /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Raymond, Darrell (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Wood, Derick (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Yu, Sheng (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1997.
• Έκδοση: 1st ed. 1997.
• Σειρά: Lecture Notes in Computer Science, 1260
• Θέματα: Programming languages (Electronic computers).; Mathematical logic.; Architecture, Computer.; Computer logic.; Computers.; Programming Languages, Compilers, Interpreters.; Mathematical Logic and Foundations.; Computer System Implementation.; Mathematical Logic and Formal Languages.; Logics and Meanings of Programs.; Computation by Abstract Devices.

This book constitutes the strictly refereed post-workshop proceedings of the First International Workshop on Implementing Automata, WIA'96, held in London, Ontario, Canada, in August 1996. The volume presents 13 revised full papers together with an introduction and survey. The papers explore th...

Πίνακας περιεχομένων:

• WIA and the practice of theory in computer science
• Algorithms for guided tree automata
• Time series forecasting by finite-state automata
• Dynamical implementation of nondeterministic automata and concurrent systems
• Implementing WS1S via finite automata
• Instruction computation in subset construction
• Building automaton on schemata and acceptability tables
• FSA utilities: A toolbox to manipulate finite-state automata
• A new quadratic algorithm to convert a regular expression into an automaton
• Implementing sequential and parallel programs for the homing sequence problem
• Integrating hands-on work into the formal languages course via tools and programming
• NFA to DFA transformation for finite languages
• How to use sorting procedures to minimize DFA
• FIRE Lite: FAs and REs in C++.