Language:
English
繁體中文
Help
回圖書館首頁
手機版館藏查詢
Login
Back
Switch To:
Labeled
|
MARC Mode
|
ISBD
Language and automata theory and app...
~
LATA (Conference) (2018 :)
Linked to FindBook
Google Book
Amazon
博客來
Language and automata theory and applications = 12th International Conference, LATA 2018, Ramat Gan, Israel, April 9-11, 2018 : proceedings /
Record Type:
Electronic resources : Monograph/item
Title/Author:
Language and automata theory and applications/ edited by Shmuel Tomi Klein, Carlos Martin-Vide, Dana Shapira.
Reminder of title:
12th International Conference, LATA 2018, Ramat Gan, Israel, April 9-11, 2018 : proceedings /
remainder title:
LATA 2018
other author:
Klein, Shmuel Tomi.
corporate name:
LATA (Conference)
Published:
Cham :Springer International Publishing : : 2018.,
Description:
x, 321 p. :ill., digital ;24 cm.
[NT 15003449]:
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.
Contained By:
Springer eBooks
Subject:
Machine theory - Congresses. -
Online resource:
http://dx.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 applications
12th 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 ;10792..
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:
546807
Machine theory
--Congresses.
LC Class. No.: QA267
Dewey Class. No.: 006.3
Language and automata theory and applications = 12th International Conference, LATA 2018, Ramat Gan, Israel, April 9-11, 2018 : proceedings /
LDR
:03880nmm a2200361 a 4500
001
2136558
003
DE-He213
005
20180307082702.0
006
m d
007
cr nn 008maaau
008
181117s2018 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
$a
LATA (Conference)
$n
(12th :
$d
2018 :
$c
Ramat Gan, Israel)
$3
3308026
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
546807
650
0
$a
Formal languages
$v
Congresses.
$3
546808
650
0
$a
Mathematical linguistics
$v
Congresses.
$3
3221389
650
1 4
$a
Computer Science.
$3
626642
650
2 4
$a
Logics and Meanings of Programs.
$3
892495
650
2 4
$a
Mathematical Logic and Formal Languages.
$3
892517
650
2 4
$a
Algorithm Analysis and Problem Complexity.
$3
891007
650
2 4
$a
Programming Techniques.
$3
892496
650
2 4
$a
Artificial Intelligence (incl. Robotics)
$3
890894
650
2 4
$a
Probability and Statistics in Computer Science.
$3
891072
700
1
$a
Klein, Shmuel Tomi.
$3
3308027
700
1
$a
Martin-Vide, Carlos.
$3
907304
700
1
$a
Shapira, Dana.
$3
3308028
710
2
$a
SpringerLink (Online service)
$3
836513
773
0
$t
Springer eBooks
830
0
$a
Lecture notes in computer science ;
$v
10792.
$3
3308029
856
4 0
$u
http://dx.doi.org/10.1007/978-3-319-77313-1
950
$a
Computer Science (Springer-11645)
based on 0 review(s)
Location:
ALL
電子資源
Year:
Volume Number:
Items
1 records • Pages 1 •
1
Inventory Number
Location Name
Item Class
Material type
Call number
Usage Class
Loan Status
No. of reservations
Opac note
Attachments
W9343252
電子資源
11.線上閱覽_V
電子書
EB QA267
一般使用(Normal)
On shelf
0
1 records • Pages 1 •
1
Multimedia
Reviews
Add a review
and share your thoughts with other readers
Export
pickup library
Processing
...
Change password
Login