國立虎尾科技大學 |

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. /
其他作者:	Potapov, Igor.
面頁冊數:	XXI, 440 p. 71 illus.online resource. :
Contained By:	Springer Nature eBook
標題:	Computers. -
電子資源:	https://doi.org/10.1007/978-3-319-21500-6
ISBN:	9783319215006

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] :edited by Igor Potapov. - 1st ed. 2015. - XXI, 440 p. 71 illus.online resource. - Theoretical Computer Science and General Issues ;9168. - Theoretical Computer Science and General Issues ;9163.

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

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

565115
Computers.

LC Class. No.: QA75.5-76.95

Dewey Class. No.: 004.0151

Developments in Language Theory = 19th International Conference, DLT 2015, Liverpool, UK, July 27-30, 2015, Proceedings. /
LDR:04000nam a22004095i 4500 001 969170
003 DE-He213
005 20200701043839.0
007 cr nn 008mamaa
008 201211s2015 gw | s |||| 0|eng d
020 $a 9783319215006 $9 978-3-319-21500-6
024 7 $a 10.1007/978-3-319-21500-6 $2 doi
035 $a 978-3-319-21500-6
050 4 $a QA75.5-76.95
072 7 $a UY $2 bicssc
072 7 $a COM037000 $2 bisacsh
072 7 $a UY $2 thema
082 0 4 $a 004.0151 $2 23
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.
250 $a 1st ed. 2015.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2015.
300 $a XXI, 440 p. 71 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 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 Computers. $3 565115
650 0 $a Mathematical logic. $2 bicssc $3 810627
650 0 $a Algorithms. $3 527865
650 0 $a Computer science—Mathematics. $3 1253519
650 1 4 $a Computation by Abstract Devices. $3 669792
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 Discrete Mathematics in Computer Science. $3 670123
700 1 $a Potapov, Igor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 793384
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783319215013
776 0 8 $i Printed edition: $z 9783319214993
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-21500-6
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)