000913352 000__ 03769cam\a2200565Ki\4500
000913352 001__ 913352
000913352 005__ 20230306150424.0
000913352 006__ m\\\\\o\\d\\\\\\\\
000913352 007__ cr\cn\nnnunnun
000913352 008__ 190725s2019\\\\sz\a\\\\ob\\\\101\0\eng\d
000913352 020__ $$a9783030248864$$q(electronic book)
000913352 020__ $$a3030248860$$q(electronic book)
000913352 0247_ $$a10.1007/978-3-030-24886-4$$2doi
000913352 035__ $$aSP(OCoLC)on1113915029
000913352 035__ $$aSP(OCoLC)1113915029
000913352 040__ $$aDKU$$beng$$erda$$cDKU$$dGW5XE$$dYDXIT$$dUKMGB
000913352 049__ $$aISEA
000913352 050_4 $$aQA267.3$$b.C63 2019
000913352 050_4 $$aQA75.5
000913352 08204 $$a005.13/1$$223
000913352 08204 $$a005.1015113
000913352 1112_ $$aConference on Developments in Language Theory$$n(23rd :$$d2019 :$$cWarsaw, Poland)
000913352 24510 $$aDevelopments in language theory :$$b23rd International Conference, DLT 2019, Warsaw, Poland, August 5-9, 2019 : proceedings /$$cPiotrek Hofman, Michał Skrzypczak (eds.).
000913352 24630 $$aDLT 2019
000913352 264_1 $$aCham, Switzerland :$$bSpringer,$$c[2019]
000913352 300__ $$a1 online resource (x, 319 pages) :$$billustrations.
000913352 336__ $$atext$$btxt$$2rdacontent
000913352 337__ $$acomputer$$bc$$2rdamedia
000913352 338__ $$aonline resource$$bcr$$2rdacarrier
000913352 4901_ $$aLecture notes in computer science$$v11647
000913352 4901_ $$aLNCS sublibrary: SL1 - Theoretical computer science and general issues
000913352 500__ $$aInternational conference proceedings.
000913352 504__ $$aIncludes bibliographical references and author index.
000913352 50580 $$tFirst lower bounds for palindromic length /$$rAnna E. Frid --$$tOn palindromic length of Sturmian sequences /$$rPetr Ambrož and Edita Pelantová --$$tSeparating many words by counting occurrences of factors /$$rAleksi Saarela --$$tk-Spectra of weakly-c-balanced words /$$rJoel D. Day, Pamela Fleischmann, Florin Manea, and Dirk Nowotka --$$tComputing the k-binomial complexity of the Thue-Morse word /$$rMarie Lejeune, Julien Leroy, and Michel Rigo --$$tContext-free word problem semigroups /$$rTara Brough, Alan J. Cain, and Markus Pfeiffer --$$tAnalysis of symbol statistics in bicomponent rational models /$$rM. Goldwurm, J. Lin, and M. Vignati.
000913352 506__ $$aAccess limited to authorized users.
000913352 520__ $$aThis book constitutes the proceedings of the 23rd International Conference on Developments in Language Theory, DLT 2019, held in Warsaw, Poland, in August 2019. The 20 full papers presented together with three invited talks were carefully reviewed and selected from 30 submissions. The papers cover the following topics and areas: combinatorial and algebraic properties of words and languages; grammars, acceptors and transducers for strings, trees, graphics, 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; celluar automata; bio-inspired computing; quantum computing. --$$cProvided by publisher.
000913352 588__ $$aDescription based on online resource; title from digital title page (viewed on September 09, 2019).
000913352 650_0 $$aFormal languages$$vCongresses.
000913352 650_0 $$aLogic design$$vCongresses.
000913352 650_0 $$aElectronic data processing$$vCongresses.
000913352 650_0 $$aData structures (Computer science)$$vCongresses.
000913352 650_0 $$aComputer science$$vCongresses.
000913352 7001_ $$aHofman, Piotrek,$$eeditor.
000913352 7001_ $$aSkrzypczak, Michał,$$eeditor.
000913352 830_0 $$aLecture notes in computer science ;$$v11647.
000913352 830_0 $$aLNCS sublibrary.$$nSL 1,$$pTheoretical computer science and general issues.
000913352 852__ $$bebk
000913352 85640 $$3SpringerLink$$uhttps://univsouthin.idm.oclc.org/login?url=http://link.springer.com/10.1007/978-3-030-24886-4$$zOnline Access$$91397441.1
000913352 909CO $$ooai:library.usi.edu:913352$$pGLOBAL_SET
000913352 980__ $$aEBOOK
000913352 980__ $$aBIB
000913352 982__ $$aEbook
000913352 983__ $$aOnline
000913352 994__ $$a92$$bISE