國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Language and automata theory and app...

(1998 :)

Language and automata theory and applications12th International Conference, LATA 2018, Ramat Gan, Israel, April 9-11, 2018 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Language and automata theory and applicationsedited by Shmuel Tomi Klein, Carlos Martin-Vide, Dana Shapira.
其他題名:	12th International Conference, LATA 2018, Ramat Gan, Israel, April 9-11, 2018 : proceedings /
其他題名:	LATA 2018
其他作者:	Klein, Shmuel Tomi.
團體作者:
出版者:	Cham :Springer International Publishing :2018.
面頁冊數:	x, 321 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
標題:	Machine theoryCongresses.
電子資源:	http://dx.doi.org/10.1007/978-3-319-77313-1
ISBN:	9783319773131$q(electronic bk.)

Language and automata theory and applications12th 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] :LATA 2018edited by Shmuel Tomi Klein, Carlos Martin-Vide, Dana Shapira. - Cham :Springer International Publishing :2018. - x, 321 p. :ill., digital ;24 cm. - Lecture notes in computer science,107920302-9743 ;. - Lecture notes in computer science ;4891..

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$q(electronic bk.)

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

442590
Machine theory
--Congresses.

LC Class. No.: QA267

Dewey Class. No.: 006.3

Language and automata theory and applications12th International Conference, LATA 2018, Ramat Gan, Israel, April 9-11, 2018 : proceedings /
LDR:03880nmm a2200361 a 4500 001 533464
003 DE-He213
005 20180307082702.0
006 m d
007 cr nn 008maaau
008 181205s2018 gw s 0 eng d
020 $a 9783319773131$q(electronic bk.)
020 $a 9783319773124$q(paper)
024 7 $a 10.1007/978-3-319-77313-1 $2 doi
035 $a 978-3-319-77313-1
040 $a GP $c GP
041 0 $a eng
050 4 $a QA267
072 7 $a UM $2 bicssc
072 7 $a UYF $2 bicssc
072 7 $a COM051000 $2 bisacsh
072 7 $a COM036000 $2 bisacsh
082 0 4 $a 006.3 $2 23
090 $a QA267 $b .L351 2018
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
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 Martin-Vide, Dana Shapira.
246 3 $a LATA 2018
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2018.
300 $a x, 321 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $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 Machine theory $v Congresses. $3 442590
650 0 $a Formal languages $v Congresses. $3 443051
650 0 $a Mathematical linguistics $v Congresses. $3 489452
650 1 4 $a Computer Science. $3 212513
650 2 4 $a Logics and Meanings of Programs. $3 275357
650 2 4 $a Mathematical Logic and Formal Languages. $3 275383
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 273702
650 2 4 $a Programming Techniques. $3 274470
650 2 4 $a Artificial Intelligence (incl. Robotics) $3 252959
650 2 4 $a Probability and Statistics in Computer Science. $3 274053
700 1 $a Klein, Shmuel Tomi. $3 809142
700 1 $a Martin-Vide, Carlos. $3 260865
700 1 $a Shapira, Dana. $3 809143
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 4891. $3 383229
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-77313-1
950 $a Computer Science (Springer-11645)