Übersicht			Auf mobile öffnen

Lieferstatus:	Auf Bestellung (Lieferzeit unbekannt)
Veröffentlichung:	Juni 2007
Genre:	EDV / Informatik
	C / Computation by Abstract Devices / Computer architecture & logic design / Computer logic / Computer programming / software engineering / computer science / Computer Science Logic and Foundations of Programming / Computer science—Mathematics / Computers / Discrete Mathematics / Discrete Mathematics in Computer Science / Formal Languages and Automata Theory / Logics and Meanings of Programs / Mathematical logic / Mathematical Logic and Formal Languages / Maths for computer scientists / Symbolic and Algebraic Manipulation / Theory of Computation mehr...
ISBN:	9783540732075
EAN-Code:	9783540732075
Verlag:	Springer EN
Einband:	Kartoniert
Sprache:	English
Serie:	#4588 - Lecture Notes in Computer Science Theoretical Computer Science and General Issues
Dimensionen:	H 235 mm / B 155 mm / D 23 mm
Gewicht:	670 gr
Seiten:	428
Illustration:	XI, 428 p.
Zus. Info:	EUDR exemption - product or manufacturing materials placed on the market prior to 31.12.2025.
Bewertung:	Titel bewerten / Meinung schreiben

Inhalt:

Invited Talks.- On First-Order Fragments for Words and Mazurkiewicz Traces.- Quantitative Generalizations of Languages.- What Do We Know About Language Equations?.- Information Distance and Applications.- Finite Automata and the Writing of Numbers.- Descriptional Complexity of Nondeterministic Finite Automata.- Contributed Papers.- From Determinism to Non-determinism in Recognizable Two-Dimensional Languages.- Coding Partitions: Regularity, Maximality and Global Ambiguity.- Multi-letter Reversible and Quantum Finite Automata.- Approximability and Non-approximability Results in Computing the Mean Speedup of Trace Monoids.- The Dynamics of Cellular Automata in Shift-Invariant Topologies.- Two Element Unavoidable Sets of Partial Words.- Hairpin Finite Automata.- Characterizing Reduction Graphs for Gene Assembly in Ciliates.- 2-Visibly Pushdown Automata.- An Efficient Computation of the Equation -Automaton of a Regular -Expression.- An Extension of Newton's Method to ?-Continuous Semirings.- Non-constructive Methods for Finite Probabilistic Automata.- The Unambiguity of Segmented Morphisms.- Commutation of Binary Factorial Languages.- Inapproximability of Nondeterministic State and Transition Complexity Assuming P???NP.- State Complexity of Union and Intersection of Finite Languages.- Bisimulation Minimisation for Weighted Tree Automata.- Conjunctive Grammars Can Generate Non-regular Unary Languages.- Deterministic Blow-Ups of Minimal Nondeterministic Finite Automata over a Fixed Alphabet.- Reduced Languages as ?-Generators.- Avoiding Approximate Squares.- Duplication Roots.- Complexity Theory for Splicing Systems.- Descriptional Complexity of Bounded Context-Free Languages.- Definable Transductions and Weighted Logics for Texts.- A Star Operation forStar-Free Trace Languages.- Finite Automata on Unranked and Unordered DAGs.- On Almost Periodicity Criteria for Morphic Sequences in Some Particular Cases.- A Local Balance Property of Episturmian Words.- Suffix Automata and Standard Sturmian Words.- Fine Hierarchy of Regular Aperiodic ?-Languages.- On Transition Minimality of Bideterministic Automata.