Übersicht			Auf mobile öffnen

Lieferstatus:	Auf Bestellung (Lieferzeit unbekannt)
Veröffentlichung:	Juni 2009
Genre:	EDV / Informatik
	Algorithm Analysis and Problem Complexity / Algorithmen und Datenstrukturen / Algorithms / Algorithms & data structures / C / Computation by Abstract Devices / computer science / Computer science—Mathematics / Computers / Discrete Mathematics / Discrete Mathematics in Computer Science / Diskrete Mathematik / Formal Languages and Automata Theory / Mathematical logic / Mathematical Logic and Formal Languages / Mathematical theory of computation / Mathematics of Computing / Mathematik für Informatiker / Maths for computer scientists / Symbolic and Algebraic Manipulation / Theory of Computation mehr...
ISBN:	9783642027369
EAN-Code:	9783642027369
Verlag:	Springer EN
Einband:	Kartoniert
Sprache:	English
Serie:	#5583 - Lecture Notes in Computer Science Theoretical Computer Science and General Issues
Dimensionen:	H 235 mm / B 155 mm / D
Gewicht:	789 gr
Seiten:	503
Illustration:	XIII, 503 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.- Factorization Forests.- Weighted versus Probabilistic Logics.- Post Correspondence Problem and Small Dimensional Matrices.- Size Complexity of Two-Way Finite Automata.- Matrix Mortality and the ?erný-Pin Conjecture.- Regular Papers.- A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata.- Regular Languages Definable by Majority Quantifiers with Two Variables.- The Inclusion Problem of Context-Free Languages: Some Tractable Cases.- On the Complexity of Deciding Avoidability of Sets of Partial Words.- Closures in Formal Languages and Kuratowski's Theorem.- Rich and Periodic-Like Words.- Traces of Control-Flow Graphs.- Left and Right Synchronous Relations.- An Extension of the Lyndon Schützenberger Result to Pseudoperiodic Words.- Asymptotic Cellular Complexity.- Strongly Regular Grammars and Regular Approximation of Context-Free Languages.- Powers of Regular Languages.- Existence and Nonexistence of Descriptive Patterns.- On Stateless Multihead Finite Automata and Multihead Pushdown Automata.- On Negative Bases.- Crucial Words for Abelian Powers.- Tight Bounds on the Descriptional Complexity of Regular Expressions.- Subshifts, Languages and Logic.- Magic Numbers and Ternary Alphabet.- The Pumping Lemma for Well-Nested Multiple Context-Free Languages.- The Support of a Recognizable Series over a Zero-Sum Free, Commutative Semiring Is Recognizable.- A Game-Theoretic Characterization of Boolean Grammars.- Word Equations with One Unknown.- On Equations over Sets of Numbers and Their Limitations.- Some Remarks on Superposition Based on Watson-Crick-Like Complementarity.- A Weighted ?-Calculus on Words.- Branching-Time Temporal Logics with Minimal Model Quantifiers.- Simulations by Time-Bounded Counter Machines.- WeightedTimed MSO Logics.- Balanced Words Having Simple Burrows-Wheeler Transform.- On the Complexity of Hmelevskii's Theorem and Satisfiability of Three Unknown Equations.- Definability in the Infix Order on Words.- Two-Sided Bounds for the Growth Rates of Power-Free Languages.- On the Decidability of the Equivalence for a Certain Class of Transducers.- Erasing in Petri Net Languages and Matrix Grammars.