Language and Automata Theory and Applications

Underlying principles and recurring ideas of formal grammars.- Sliding Window Algorithms for Regular Languages.- Reshaping the context-free model: linguistic and algorithmic aspects.- Disturbance Decoupling in Finite Automata.- On the synchronization of planar automata.- Event-Clock Nested Automata.- On Periodicity Lemma for Partial Words.- Bubble-Flip - A New Generation Algorithm for Prefix Normal Words.- Pomsets and Unfolding of Reset Petri Nets.- Over-Approximative Petri Net Synthesis for Restricted Subclasses of Nets.- Measuring Closeness between Cayley Automatic Groups and Automatic Groups.- Permutations sorted by a finite and an infinite stack in series.- Analytic combinatorics of lattice paths with forbidden patterns: enumerative aspects.- Deciding regular intersection emptiness of complete problems for PSPACE and the polynomial hierarchy.- Descriptional and computational complexity of the circuit representation of finite automata.- Model Learning as a Satisfiability Modulo Theories Problem.- Default Logic and Bounded Treewidth.- General Class of Monoids Supporting Canonisation and Minimisation of (Sub)sequential Transducers.- Learners Based on Transducers.- Handling ties correctly and efficiently in Viterbi training using the Viterbi semiring.- Formal languages over GF(2).- Timed Comparisons of Semi-Markov Processes.- Efficient Translation with Linear Bimorphisms.