Description 
1 online resource (x, 321 pages) : 39 illustrations 
Series 
Lecture Notes in Computer Science, 03029743 ; 10792 

LNCS sublibrary. SL 1, Theoretical computer science and general issues 

Lecture notes in computer science ; 10792. 03029743


LNCS sublibrary. SL 1, Theoretical computer science and general issues.

Contents 
Underlying principles and recurring ideas of formal grammars  Sliding Window Algorithms for Regular Languages  Reshaping the contextfree model: linguistic and algorithmic aspects  Disturbance Decoupling in Finite Automata  On the synchronization of planar automata  EventClock Nested Automata  On Periodicity Lemma for Partial Words  BubbleFlip  A New Generation Algorithm for Prefix Normal Words  Pomsets and Unfolding of Reset Petri Nets  OverApproximative 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 SemiMarkov Processes  Efficient Translation with Linear Bimorphisms 
Summary 
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 submissions. The papers cover fields like algebraic language theory, algorithms for semistructured data mining, algorithms on automata and words, automata and logic, automata for system analysis and programme verification, automata networks, automatic structures, codes, combinatorics on words, computational complexity, concurrency and Petri nets, data and image compression, descriptional complexity, foundations of finite state technology, foundations of XML, grammars (Chomsky hierarchy, contextual, unification, categorial, etc.), grammatical inference and algorithmic learning, graphs and graph transformation, language varieties and semigroups, languagebased cryptography, mathematical and logical foundations of programming methodologies, parallel and regulated rewriting, parsing, patterns, power series, string processing algorithms, symbolic dynamics, term rewriting, transducers, trees, tree languages and tree automata, and weighted automata 
Subject 
Machine theory  Congresses


Formal languages  Congresses


Mathematical linguistics  Congresses


Mathematical theory of computation.


Algorithms & data structures.


Computer programming  software development.


Artificial intelligence.


Maths for computer scientists.


Mathematics  Logic.


Computers  Programming  Algorithms.


Computers  Programming  General.


Computers  Intelligence (AI) & Semantics.


Computers  Mathematical & Statistical Software.


Formal languages.


Machine theory.


Mathematical linguistics.

Genre/Form 
Electronic books


Conference papers and proceedings.


Conference papers and proceedings.

Form 
Electronic book

Author 
Klein, Shmuel Tomi, editor


MartínVide, Carlos, editor


Shapira, Dana, editor

ISBN 
9783319773131 

3319773135 
