Übersicht			Auf mobile öffnen

Lieferstatus:	i.d.R. innert 5-10 Tagen versandfertig
Veröffentlichung:	Januar 2003
Genre:	EDV / Informatik
	algorithmanalysisandproblemcomplexity / Algorithms / Automata / automatacomputations / automatatheory / Automatentheorie / cellularautomata / EDV / Theorie / Programmieren / Allgemeines / finiteautomata / formallanguages / formalmethods / Foundations / Implementations / Künstliche Intelligenz (KI) / Modeling / naturallanguage / proving / Simulation / Statecharts / Theoretische Informatik mehr...
ISBN:	9783540004004
EAN-Code:	9783540004004
Verlag:	Springer
Einband:	Kartoniert
Sprache:	English
Serie:	#2494 - Lecture Notes in Computer Science
Dimensionen:	H 235 mm / B 155 mm / D 17 mm
Gewicht:	464 gr
Seiten:	304
Bewertung:	Titel bewerten / Meinung schreiben

Inhalt:

Using Finite State Technology in Natural Language Processing of Basque.- Cascade Decompositions are Bit-Vector Algorithms.- Submodule Construction and Supervisory Control: A Generalization.- Counting the Solutions of Presburger Equations without Enumerating Them.- Brzozowski's Derivatives Extended to Multiplicities.- Finite Automata for Compact Representation of Language Models in NLP.- Past Pushdown Timed Automata.- Scheduling Hard Sporadic Tasks by Means of Finite Automata and Generating Functions.- Bounded-Graph Construction for Noncanonical Discriminating-Reverse Parsers.- Finite-State Transducer Cascade to Extract Proper Names in Texts.- Is this Finite-State Transducer Sequentiable?.- Compilation Methods of Minimal Acyclic Finite-State Automata for Large Dictionaries.- Bit Parallelism - NFA Simulation.- Improving Raster Image Run-Length Encoding Using Data Order.- Enhancements of Partitioning Techniques for Image Compression Using Weighted Finite Automata.- Extraction of ?-Cycles from Finite-State Transducers.- On the Size of Deterministic Finite Automata.- Crystal Lattice Automata.- Minimal Adaptive Pattern-Matching Automata for Efficient Term Rewriting.- Adaptive Rule-Driven Devices - General Formulation and Case Study.- Typographical Nearest-Neighbor Search in a Finite-State Lexicon and Its Application to Spelling Correction.- On the Software Design of Cellular Automata Simulators for Ecological Modeling.- Random Number Generation with ?-NFAs.- Supernondeterministic Finite Automata.