Language and Automata Theory and Applications 12th International Conference, LATA 2018, Ramat Gan, Israel, April 9-11, 2018, Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Klein, Shmuel Tomi (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Martín-Vide, Carlos (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Shapira, Dana (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Cham : Springer International Publishing : Imprint: Springer, 2018.
• Έκδοση: 1st ed. 2018.
• Σειρά: Theoretical Computer Science and General Issues ; 10792
• Θέματα: Computer logic.; Mathematical logic.; Algorithms.; Computer programming.; Artificial intelligence.; Mathematical statistics.; Logics and Meanings of Programs.; Mathematical Logic and Formal Languages.; Algorithm Analysis and Problem Complexity.; Programming Techniques.; Artificial Intelligence.; Probability and Statistics in Computer Science.

This book constitutes the refereed proceedings of the 12th International Conference on Language and Automata Theory and Applications, LATA 2018, held in Ramat Gan, Israel, in April 2018. The 20 revised full papers presented together with 3 invited papers were carefully reviewed and selected from 58...

Πίνακας περιεχομένων:

• 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.