|
|
|
|
Minimal and Monotone Minimal Perfect Hash Functions |
|
|
3 | (15) |
|
|
|
Equational Properties of Fixed Point Operations in Cartesian Categories: An Overview |
|
|
18 | (20) |
|
|
|
Reversible and Irreversible Computations of Deterministic Finite-State Devices |
|
|
38 | (15) |
|
|
|
Robust Inference and Local Algorithms |
|
|
53 | (10) |
|
|
|
Logic, Semantics, Automata and Theory of Programming |
|
|
|
Uniform Generation in Trace Monoids |
|
|
63 | (13) |
|
|
|
|
|
When Are Prime Formulae Characteristic? |
|
|
76 | (13) |
|
|
|
|
|
|
|
|
|
Stochastization of Weighted Automata |
|
|
89 | (14) |
|
|
|
|
|
Algebraic Synchronization Criterion and Computing Reset Words |
|
|
103 | (13) |
|
|
|
|
|
Recurrence Function on Sturmian Words: A Probabilistic Study |
|
|
116 | (13) |
|
|
|
|
|
|
|
|
|
|
|
Exponential-Size Model Property for PDL with Separating Parallel Composition |
|
|
129 | (12) |
|
|
|
A Circuit Complexity Approach to Transductions |
|
|
141 | (13) |
|
|
|
|
|
|
|
|
|
Locally Chain-Parsable Languages |
|
|
154 | (13) |
|
|
|
|
|
|
|
|
|
Classes of Languages Generated by the Kleene Star of a Word |
|
|
167 | (12) |
|
|
|
|
|
Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculus |
|
|
179 | (13) |
|
|
|
|
|
|
|
Weighted Automata and Logics on Graphs |
|
|
192 | (13) |
|
|
|
|
|
Longest Gapped Repeats and Palindromes |
|
|
205 | (13) |
|
|
|
|
|
Quasiperiodicity and Non-computability in Tilings |
|
|
218 | (13) |
|
|
|
|
|
The Transitivity Problem of Turing Machines |
|
|
231 | (12) |
|
|
|
|
|
|
|
Strong Inapproximability of the Shortest Reset Word |
|
|
243 | (13) |
|
|
|
|
|
Finitary Semantics of Linear Logic and Higher-Order Model-Checking |
|
|
256 | (13) |
|
|
|
|
|
Complexity of Propositional Independence and Inclusion Logic |
|
|
269 | (12) |
|
|
|
|
|
|
|
|
|
Modal Inclusion Logic: Being Lax is Simpler than Being Strict |
|
|
281 | (12) |
|
|
|
|
|
|
|
|
|
Differential Bisimulation for a Markovian Process Algebra |
|
|
293 | (14) |
|
|
|
|
|
|
|
On the Hardness of Almost--Sure Termination |
|
|
307 | (12) |
|
|
|
|
|
Graphs Identified by Logics with Counting |
|
|
319 | (12) |
|
|
|
|
|
|
|
Synchronizing Automata with Extremal Properties |
|
|
331 | (13) |
|
|
|
|
|
Ratio and Weight Quantiles |
|
|
344 | (13) |
|
|
|
|
|
|
|
|
|
Precise Upper and Lower Bounds for the Monotone Constraint Satisfaction Problem |
|
|
357 | (12) |
|
|
|
Definability by Weakly Deterministic Regular Expressions with Counters is Decidable |
|
|
369 | (13) |
|
|
|
|
|
On the Complexity of Reconfiguration in Systems with Legacy Components |
|
|
382 | (12) |
|
|
|
|
|
Eliminating Recursion from Monadic Datalog Programs on Trees |
|
|
394 | (13) |
|
|
|
|
|
|
|
Computability on the Countable Ordinals and the Hausdorff-Kuratowski Theorem (Extended Abstract) |
|
|
407 | (12) |
|
|
|
Emergence on Decreasing Sandpile Models |
|
|
419 | (13) |
|
|
|
|
|
Lost in Self-Stabilization |
|
|
432 | (12) |
|
|
|
|
|
Equations and Coequations for Weighted Automata |
|
|
444 | (13) |
|
|
|
|
|
|
| Author Index |
|
457 | |
Lisainfo e-raamatute kohta