|  |
 |
| Artikel-Nr.: 5667A-9783540428121 Herst.-Nr.: 9783540428121 EAN/GTIN: 9783540428121 |
| |
|
|  |  |
 | FA Minimisation Heuristics for a Class of Finite Languages.- SEA: A Symbolic Environment for Automata Theory.- Analysis of Reactive Systems with n Timers.- Animation of the Generation and Computation of Finite Automata for Learning Software.- Metric Lexical Analysis.- State Complexity of Basic Operations on Finite Languages.- Treatment of Unknown Words.- Computing Entropy Maps of Finite-Automaton-Encoded Binary Images.- Thompson Digraphs: A Characterization.- Finite Automata Encoding Geometric Figures.- Compressed Storage of Sparse Finite-State Transducers.- An Extendible Regular Expression Compiler for Finite-State Approaches in Natural Language Processing.- Multiset Processing by Means of Systems of Finite State Transducers.- A Structural Method for Output Compaction of Sequential Automata Implemented as Circuits.- An Algorithm to Verify Local Threshold Testability of Deterministic Finite Automata.- A Taxonomy of Algorithms for Constructing Minimal Acyclic Deterministic Finite Automata. Weitere Informationen:  |  | Author: | Oliver Boldt; Helmut Jürgensen | Verlag: | Springer Berlin | Sprache: | eng |
|
|  |  |
 | |  |  |
 | Weitere Suchbegriffe: allgemeine Informatikbücher - englischsprachig, allgemeine informatikbücher - englischsprachig, EDV / Theorie / Programmieren / Allgemeines, Automat, Automata, Automata Theory, Cellular Automata, Finite Automata, Finite Languages, Finite-State Systems, Formal Languages, Grammar Systems, Grammars |
|  |  |
| |