國立虎尾科技大學 |

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

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Language and Automata Theory and Applications/ edited by Shmuel Tomi Klein, Carlos Martín-Vide, Dana Shapira.
Reminder of title:	12th International Conference, LATA 2018, Ramat Gan, Israel, April 9-11, 2018, Proceedings /
other author:	Klein, Shmuel Tomi.
Description:	X, 321 p. 39 illus.online resource. :
Contained By:	Springer Nature eBook
Subject:	Computer logic. -
Online resource:	https://doi.org/10.1007/978-3-319-77313-1
ISBN:	9783319773131

Language and Automata Theory and Applications = 12th International Conference, LATA 2018, Ramat Gan, Israel, April 9-11, 2018, Proceedings /
Language and Automata Theory and Applications12th International Conference, LATA 2018, Ramat Gan, Israel, April 9-11, 2018, Proceedings /[electronic resource] :edited by Shmuel Tomi Klein, Carlos Martín-Vide, Dana Shapira. - 1st ed. 2018. - X, 321 p. 39 illus.online resource. - Theoretical Computer Science and General Issues ;10792. - Theoretical Computer Science and General Issues ;9163.

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.

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 semi-structured 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, language-based 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.

ISBN: 9783319773131

Standard No.: 10.1007/978-3-319-77313-1doiSubjects--Topical Terms:

786340
Computer logic.

LC Class. No.: QA76.9.L63

Dewey Class. No.: 005.1015113

Language and Automata Theory and Applications = 12th International Conference, LATA 2018, Ramat Gan, Israel, April 9-11, 2018, Proceedings /
LDR:04231nam a22004335i 4500 001 994465
003 DE-He213
005 20200703062335.0
007 cr nn 008mamaa
008 201225s2018 gw | s |||| 0|eng d
020 $a 9783319773131 $9 978-3-319-77313-1
024 7 $a 10.1007/978-3-319-77313-1 $2 doi
035 $a 978-3-319-77313-1
050 4 $a QA76.9.L63
050 4 $a QA76.5913
072 7 $a UM $2 bicssc
072 7 $a COM051000 $2 bisacsh
072 7 $a UM $2 thema
072 7 $a UYF $2 thema
082 0 4 $a 005.1015113 $2 23
245 1 0 $a Language and Automata Theory and Applications $h [electronic resource] : $b 12th International Conference, LATA 2018, Ramat Gan, Israel, April 9-11, 2018, Proceedings / $c edited by Shmuel Tomi Klein, Carlos Martín-Vide, Dana Shapira.
250 $a 1st ed. 2018.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2018.
300 $a X, 321 p. 39 illus. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Theoretical Computer Science and General Issues ; $v 10792
505 0 $a 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.
520 $a 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 semi-structured 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, language-based 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.
650 0 $a Computer logic. $3 786340
650 0 $a Mathematical logic. $2 bicssc $3 810627
650 0 $a Algorithms. $3 527865
650 0 $a Computer programming. $3 527822
650 0 $a Artificial intelligence. $3 559380
650 0 $a Mathematical statistics. $3 527941
650 1 4 $a Logics and Meanings of Programs. $3 670058
650 2 4 $a Mathematical Logic and Formal Languages. $3 670059
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 2 4 $a Programming Techniques. $3 669781
650 2 4 $a Artificial Intelligence. $3 646849
650 2 4 $a Probability and Statistics in Computer Science. $3 669886
700 1 $a Klein, Shmuel Tomi. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1201882
700 1 $a Martín-Vide, Carlos. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1258335
700 1 $a Shapira, Dana. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1201883
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783319773124
776 0 8 $i Printed edition: $z 9783319773148
830 0 $a Theoretical Computer Science and General Issues ; $v 9163 $3 1253524
856 4 0 $u https://doi.org/10.1007/978-3-319-77313-1
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)