What is included with this book?
On first-order fragments for words and Mazurkiewicz traces | p. 1 |
Quantitative generalizations of languages | p. 20 |
What do we know about language equations? | p. 23 |
Information distance and applications | p. 28 |
Finite automata and the writing of numbers | p. 29 |
Descriptional complexity of nondeterministic finite automata | p. 31 |
From determinism to non-determinism in recognizable two-dimensional languages | p. 36 |
Coding partitions : regularity, maximality and global ambiguity | p. 48 |
Multi-letter reversible and quantum finite automata | p. 60 |
Approximability and non-approximability results in computing the mean speedup of trace monoids | p. 72 |
The dynamics of cellular automata in shift-invariant topologies | p. 84 |
Two element unavoidable sets of partial words | p. 90 |
Hairpin finite automata | p. 108 |
Characterizing reduction graphs for gene assembly in ciliates | p. 120 |
2-visibly pushdown automata | p. 132 |
An efficient computation of the equation K-automaton of a regular K-expression | p. 145 |
An extension of Newton's method to [omega]-continuous semirings | p. 157 |
Non-constructive methods for finite probabilistic automata | p. 169 |
The unambiguity of segmented morphisms | p. 181 |
Commutation of binary factorial languages | p. 193 |
Inapproximability of nondeterministic state and transition complexity assuming P [actual symbol not reproducible] NP | p. 205 |
State complexity of union and intersection of finite languages | p. 217 |
Bisimulation minimisation for weighted tree automata | p. 229 |
Conjunctive grammars can generate non-regular unary languages | p. 242 |
Deterministic blow-ups of minimal nondeterministic finite automata over a fixed alphabet | p. 254 |
Reduced languages as [omega]-generators | p. 266 |
Avoiding approximate squares | p. 278 |
Duplication roots | p. 290 |
Complexity theory for splicing systems | p. 300 |
Descriptional complexity of bounded context-free languages | p. 312 |
Definable transductions and weighted logics for texts | p. 324 |
A star operation for star-free trace languages | p. 337 |
Finite automata on unranked and unordered DAGs | p. 346 |
On Almost periodicity criteria for morphic sequences in some particular cases | p. 361 |
A local balance property of episturmian words | p. 371 |
Suffix automata and standard sturmian words | p. 382 |
Fine hierarchy of regular aperiodic [omega]-languages | p. 399 |
On transition minimality of bideterministic automata | p. 411 |
Table of Contents provided by Blackwell. All Rights Reserved. |
The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any access cards, study guides, lab manuals, CDs, etc.
The Used, Rental and eBook copies of this book are not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.