FPsolve: A Generic Solver for Fixpoint Equations over Semirings.- Restarting Automata for Picture Languages: A Survey on Recent Developments.- Investigations on Automata and Languages over a Unary Alphabet.- Cellular Automata for Crowd Dynamics.- Counting Equivalent Linear Finite Transducers Using a Canonical Form.- On the Power of One-Way Automata with Quantum and Classical States.- On Comparing Deterministic Finite Automata and the Shuffle of Words.- Minimal Partial Languages and Automata.- Large Aperiodic Semigroups.- On the Square of Regular Languages.- Unary Languages Recognized by Two-Way One-Counter Automata.- A Type System for Weighted Automata and Rational Expressions.- Bounded Prefix-Suffix Duplication.- Recognition of Labeled Multidigraphs by Spanning Tree Automata.- Reset Thresholds of Automata with Two Cycle Lengths.- On the Ambiguity, Finite-Valuedness, and Lossiness Problems in Acceptors and Transducers.- Kleene Closure on Regular and Prefix-Free Languages.- Left is Better than Right for Reducing Nondeterminism of NFAs.- Analytic Functions Computable by Finite State Transducers.- Partial Derivative and Position Bisimilarity Automata.- The Power of Regularity-Preserving Multi Bottom-up Tree Transducers.- Pushdown Machines for Weighted Context-Free Tree Translation.- Weighted Variable Automata over Infinite Alphabets.- Implications of Quantum Automata for Contextuality.- Pairwise Rational Kernels Obtained by Automaton Operations. 

GPSR Compliance The European Union's (EU) General Product Safety Regulation (GPSR) is a set of rules that requires consumer products to be safe and our obligations to ensure this. If you have any concerns about our products you can contact us on ProductSafety@springernature.com. In case Publisher is established outside the EU, the EU authorized representative is: Springer Nature Customer Service Center GmbH Europaplatz 3 69115 Heidelberg, Germany ProductSafety@springernature.com