東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Developments in language theory = 19...

Potapov, Igor.

FindBook

Google Book

Amazon

博客來

Developments in language theory = 19th International Conference, DLT 2015, Liverpool, UK, July 27-30, 2015 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Developments in language theory/ edited by Igor Potapov.
其他題名:	19th International Conference, DLT 2015, Liverpool, UK, July 27-30, 2015 : proceedings /
其他題名:	DLT 2015
其他作者:	Potapov, Igor.
出版者:	Cham :Springer International Publishing : : 2015.,
面頁冊數:	xxii, 440 p. :ill., digital ;24 cm.
內容註:	Recognisable Languages over Monads -- Garside and quadratic normalisation: a survey -- Grammar-Based Tree Compression -- On decidability of intermediate levels of concatenation hierarchies -- Ergodic in Finite permutations of minimal complexity -- Diverse Palindromic Factorization is NP-Complete -- Factorization in Formal Languages -- Consensus Game Acceptors -- On the Size of Two-Way Reasonable Automata for the Liveness Problem -- Squareable Words -- Complexity Analysis: Transformation Monoids of Finite Automata -- Palindromic complexity of trees -- Deciding proper conjugacy of classes of one-sided Finite-type-Dyck shifts -- Transfinite Lyndon words -- Unary patterns under permutations -- Finite Automata Over In Finite Alphabets: Two Models with Transitions for Local Change -- Enumeration formulin neutral sets -- On the Density of Context-Free and Counter Languages -- Star-Continuous Kleene Omega-Algebras -- Unary probabilistic and quantum automata on promise problems -- Generalizations of Code Languages with Marginal Errors -- Minimal Reversible Deterministic Finite Automata -- Multi-Sequential Word Relations -- The Boundary of Prefix-Free Languages -- A connected 3-state reversible Mealy automaton cannot generate an infinite Burnside group -- Path Checking for MTL and TPTL over Data Words -- On Distinguishing NC1 and NL -- Sur minimisation of automata -- On the Complexity of k-Piecewise Testability and the Depth of Automata -- Interval Exchange Words and the Question of Hof, Knill, and Simon -- State Complexity of Neighbourhoods and Approximate Pattern Matching -- Deterministic ordered restarting automata that compute functions -- Weight Assignment Logic -- Complexity Bounds of Constant-Space Quantum Computation.
Contained By:	Springer eBooks
標題:	Formal languages -
電子資源:	http://dx.doi.org/10.1007/978-3-319-21500-6
ISBN:	9783319215006 (electronic bk.)

Developments in language theory = 19th International Conference, DLT 2015, Liverpool, UK, July 27-30, 2015 : proceedings /
Developments in language theory19th International Conference, DLT 2015, Liverpool, UK, July 27-30, 2015 : proceedings /[electronic resource] :DLT 2015edited by Igor Potapov. - Cham :Springer International Publishing :2015. - xxii, 440 p. :ill., digital ;24 cm. - Lecture notes in computer science,91680302-9743 ;. - Lecture notes in computer science ;5353..

Recognisable Languages over Monads -- Garside and quadratic normalisation: a survey -- Grammar-Based Tree Compression -- On decidability of intermediate levels of concatenation hierarchies -- Ergodic in Finite permutations of minimal complexity -- Diverse Palindromic Factorization is NP-Complete -- Factorization in Formal Languages -- Consensus Game Acceptors -- On the Size of Two-Way Reasonable Automata for the Liveness Problem -- Squareable Words -- Complexity Analysis: Transformation Monoids of Finite Automata -- Palindromic complexity of trees -- Deciding proper conjugacy of classes of one-sided Finite-type-Dyck shifts -- Transfinite Lyndon words -- Unary patterns under permutations -- Finite Automata Over In Finite Alphabets: Two Models with Transitions for Local Change -- Enumeration formulin neutral sets -- On the Density of Context-Free and Counter Languages -- Star-Continuous Kleene Omega-Algebras -- Unary probabilistic and quantum automata on promise problems -- Generalizations of Code Languages with Marginal Errors -- Minimal Reversible Deterministic Finite Automata -- Multi-Sequential Word Relations -- The Boundary of Prefix-Free Languages -- A connected 3-state reversible Mealy automaton cannot generate an infinite Burnside group -- Path Checking for MTL and TPTL over Data Words -- On Distinguishing NC1 and NL -- Sur minimisation of automata -- On the Complexity of k-Piecewise Testability and the Depth of Automata -- Interval Exchange Words and the Question of Hof, Knill, and Simon -- State Complexity of Neighbourhoods and Approximate Pattern Matching -- Deterministic ordered restarting automata that compute functions -- Weight Assignment Logic -- Complexity Bounds of Constant-Space Quantum Computation.

This book constitutes the proceedings of the 19th International Conference on Developments in Language Theory, DLT 2015, held in Liverpool, UK. The 31 papers presented together with 5 invited talks were carefully reviewed and selected from 54 submissions. Its scope is very general and includes, among others, the following topics and areas: combinatorial and algebraic properties of words and languages, grammars, acceptors and transducers for strings, trees, graphs, arrays, algebraic theories for automata and languages, codes, efficient text algorithms, symbolic dynamics, decision problems, relationships to complexity theory and logic, picture description and analysis, polyominoes and bidimensional patterns, cryptography, concurrency, cellular automata, bio-inspired computing, and quantum computing.

ISBN: 9783319215006 (electronic bk.)

Standard No.: 10.1007/978-3-319-21500-6doiSubjects--Topical Terms:

703979
Formal languages

LC Class. No.: QA267.3

Dewey Class. No.: 005.131

Developments in language theory = 19th International Conference, DLT 2015, Liverpool, UK, July 27-30, 2015 : proceedings /
LDR:03646nmm a2200337 a 4500 001 2008919
003 DE-He213
005 20160225100228.0
006 m d
007 cr nn 008maaau
008 160311s2015 gw s 0 eng d
020 $a 9783319215006 (electronic bk.)
020 $a 9783319214993 (paper)
024 7 $a 10.1007/978-3-319-21500-6 $2 doi
035 $a 978-3-319-21500-6
040 $a GP $c GP
041 0 $a eng
050 4 $a QA267.3
072 7 $a UYZG $2 bicssc
072 7 $a COM037000 $2 bisacsh
082 0 4 $a 005.131 $2 23
090 $a QA267.3 $b .C748 2015
245 1 0 $a Developments in language theory $h [electronic resource] : $b 19th International Conference, DLT 2015, Liverpool, UK, July 27-30, 2015 : proceedings / $c edited by Igor Potapov.
246 3 $a DLT 2015
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2015.
300 $a xxii, 440 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 9168
505 0 $a Recognisable Languages over Monads -- Garside and quadratic normalisation: a survey -- Grammar-Based Tree Compression -- On decidability of intermediate levels of concatenation hierarchies -- Ergodic in Finite permutations of minimal complexity -- Diverse Palindromic Factorization is NP-Complete -- Factorization in Formal Languages -- Consensus Game Acceptors -- On the Size of Two-Way Reasonable Automata for the Liveness Problem -- Squareable Words -- Complexity Analysis: Transformation Monoids of Finite Automata -- Palindromic complexity of trees -- Deciding proper conjugacy of classes of one-sided Finite-type-Dyck shifts -- Transfinite Lyndon words -- Unary patterns under permutations -- Finite Automata Over In Finite Alphabets: Two Models with Transitions for Local Change -- Enumeration formulin neutral sets -- On the Density of Context-Free and Counter Languages -- Star-Continuous Kleene Omega-Algebras -- Unary probabilistic and quantum automata on promise problems -- Generalizations of Code Languages with Marginal Errors -- Minimal Reversible Deterministic Finite Automata -- Multi-Sequential Word Relations -- The Boundary of Prefix-Free Languages -- A connected 3-state reversible Mealy automaton cannot generate an infinite Burnside group -- Path Checking for MTL and TPTL over Data Words -- On Distinguishing NC1 and NL -- Sur minimisation of automata -- On the Complexity of k-Piecewise Testability and the Depth of Automata -- Interval Exchange Words and the Question of Hof, Knill, and Simon -- State Complexity of Neighbourhoods and Approximate Pattern Matching -- Deterministic ordered restarting automata that compute functions -- Weight Assignment Logic -- Complexity Bounds of Constant-Space Quantum Computation.
520 $a This book constitutes the proceedings of the 19th International Conference on Developments in Language Theory, DLT 2015, held in Liverpool, UK. The 31 papers presented together with 5 invited talks were carefully reviewed and selected from 54 submissions. Its scope is very general and includes, among others, the following topics and areas: combinatorial and algebraic properties of words and languages, grammars, acceptors and transducers for strings, trees, graphs, arrays, algebraic theories for automata and languages, codes, efficient text algorithms, symbolic dynamics, decision problems, relationships to complexity theory and logic, picture description and analysis, polyominoes and bidimensional patterns, cryptography, concurrency, cellular automata, bio-inspired computing, and quantum computing.
650 0 $a Formal languages $3 703979
650 1 4 $a Computer Science. $3 626642
650 2 4 $a Computation by Abstract Devices. $3 891207
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 Discrete Mathematics in Computer Science. $3 892513
700 1 $a Potapov, Igor. $3 1244938
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 5353. $x 0302-9743 $3 1274248
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-21500-6
950 $a Computer Science (Springer-11645)