Übersicht			Auf mobile öffnen

Lieferstatus:	i.d.R. innert 5-10 Tagen versandfertig
Veröffentlichung:	Oktober 2001
Genre:	EDV / Informatik
	Automat / Automata / automatatheory / cellularautomata / Cognition / Compiler und Übersetzer / computationallinguistics / EDV / Theorie / Programmieren / Allgemeines / Finite-StateSystems / finiteautomata / FiniteLanguages / formallanguages / Grammars / GrammarSystems / imageprocessing / Linguistics / Mustererkennung / speechrecognition / Theoretische Informatik mehr...
ISBN:	9783540428121
EAN-Code:	9783540428121
Verlag:	Springer
Einband:	Kartoniert
Sprache:	English
Serie:	#2214 - Lecture Notes in Computer Science
Dimensionen:	H 235 mm / B 155 mm / D 11 mm
Gewicht:	306 gr
Seiten:	196
Bewertung:	Titel bewerten / Meinung schreiben

Inhalt:

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.