國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Developments in language theory22nd ...

(1998 :)

Developments in language theory22nd International Conference, DLT 2018, Tokyo, Japan, September 10-14, 2018 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Developments in language theoryedited by Mizuho Hoshi, Shinnosuke Seki.
其他題名:	22nd International Conference, DLT 2018, Tokyo, Japan, September 10-14, 2018 : proceedings /
其他題名:	DLT 2018
其他作者:	Hoshi, Mizuho.
團體作者:
出版者:	Cham :Springer International Publishing :2018.
面頁冊數:	xiv, 568 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
標題:	Formal languagesCongresses.
電子資源:	https://doi.org/10.1007/978-3-319-98654-8
ISBN:	9783319986548$q(electronic bk.)

Developments in language theory22nd International Conference, DLT 2018, Tokyo, Japan, September 10-14, 2018 : proceedings /
Developments in language theory22nd International Conference, DLT 2018, Tokyo, Japan, September 10-14, 2018 : proceedings /[electronic resource] :DLT 2018edited by Mizuho Hoshi, Shinnosuke Seki. - Cham :Springer International Publishing :2018. - xiv, 568 p. :ill., digital ;24 cm. - Lecture notes in computer science,110880302-9743 ;. - Lecture notes in computer science ;4891..

Block sorting-based transformations on words: beyond the magic BWT -- The Runs Theorem and Beyond -- A Brief Excursion to Parity Games -- A tale of conjunctive grammars -- Groups, languages and dendric shifts -- Some Open Problems in Polyomino Tilings -- Weak Cost Register Automata are Still Powerful -- From Two-Way Transducers to Regular Function Expressions -- Decidability of Right One-Way Jumping Finite Automata -- Additive Number Theory via Approximation by Regular Languages -- Tree-to-graph transductions with scope -- A Characterization of Completely Reachable Automata -- Inequalities for one-step products -- On the commutative equivalence of context-free languages -- Simon's theorem for scattered words -- The Synchronizing Probability Function for Primitive Sets of Matrices -- Recognizability for automata -- Site-Directed Deletion -- Counting Subwords and Regular Languages -- Deque languages, automata and planar graphs -- A General Approach to State Complexity of Operations: Formalization and Limitations -- On Matching Generalised Repetitive Patterns -- Intersection Non-Emptiness and Hardness within Polynomial Time -- Complexity of decision problems on totally rigid acyclic tree grammars -- A Pattern Logic for Automata with Outputs -- The Intersection Problem for Finite Semigroups -- On Completely Reachable Automata and Subset Reachability -- On Minimal Grammar Problems for Finite Languages -- Reversible Pushdown Transducers -- Two-way Automata and One-Tape Machines: Read Only versus Linear Time -- Dynamics of the Independence Number and Automata Synchronization -- Closest Substring Problems for Regular Languages -- Computational Complexity of Decision Problems on Self-Verifying Finite Automata -- Generalizations of Checking Stack Automata: Characterizations and Hierarchies -- On Counting Functions of Languages -- Towards exact state complexity bounds for input-driven pushdown automata -- On Abelian Subshifts -- Reachability Problems in Nondeterministic Polynomial Maps on the Integers -- Projection for Buchi Tree Automata with Constraints between Siblings -- The Computational Power of Parsing Expression Grammars -- On finitely ambiguous Buchi automata -- Uniformization Problem for Variants of First Order Logic over Finite Words -- On deterministic ordered restart-delete automata -- Complementation of Finitely Ambiguous Buchi Automata -- A Structural Lemma for Deterministic Context-Free Languages.

This book constitutes the proceedings of the 22nd International Conference on Developments in Language Theory, DLT 2018, held in Tokyo, Japan, in September 2018. The 39 full papers presented in this volume were carefully reviewed and selected from 84 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.

ISBN: 9783319986548$q(electronic bk.)

Standard No.: 10.1007/978-3-319-98654-8doiSubjects--Topical Terms:

443051
Formal languages
--Congresses.

LC Class. No.: QA267.3

Dewey Class. No.: 005.131

Developments in language theory22nd International Conference, DLT 2018, Tokyo, Japan, September 10-14, 2018 : proceedings /
LDR:04450nmm a2200373 a 4500 001 543750
003 DE-He213
005 20180829125553.0
006 m d
007 cr nn 008maaau
008 190430s2018 gw s 0 eng d
020 $a 9783319986548$q(electronic bk.)
020 $a 9783319986531$q(paper)
024 7 $a 10.1007/978-3-319-98654-8 $2 doi
035 $a 978-3-319-98654-8
040 $a GP $c GP
041 0 $a eng
050 4 $a QA267.3
072 7 $a UM $2 bicssc
072 7 $a COM051000 $2 bisacsh
072 7 $a UM $2 thema
072 7 $a UYF $2 thema
082 0 4 $a 005.131 $2 23
090 $a QA267.3 $b .C748 2018
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
245 1 0 $a Developments in language theory $h [electronic resource] : $b 22nd International Conference, DLT 2018, Tokyo, Japan, September 10-14, 2018 : proceedings / $c edited by Mizuho Hoshi, Shinnosuke Seki.
246 3 $a DLT 2018
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2018.
300 $a xiv, 568 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 11088
490 1 $a Theoretical computer science and general issues
505 0 $a Block sorting-based transformations on words: beyond the magic BWT -- The Runs Theorem and Beyond -- A Brief Excursion to Parity Games -- A tale of conjunctive grammars -- Groups, languages and dendric shifts -- Some Open Problems in Polyomino Tilings -- Weak Cost Register Automata are Still Powerful -- From Two-Way Transducers to Regular Function Expressions -- Decidability of Right One-Way Jumping Finite Automata -- Additive Number Theory via Approximation by Regular Languages -- Tree-to-graph transductions with scope -- A Characterization of Completely Reachable Automata -- Inequalities for one-step products -- On the commutative equivalence of context-free languages -- Simon's theorem for scattered words -- The Synchronizing Probability Function for Primitive Sets of Matrices -- Recognizability for automata -- Site-Directed Deletion -- Counting Subwords and Regular Languages -- Deque languages, automata and planar graphs -- A General Approach to State Complexity of Operations: Formalization and Limitations -- On Matching Generalised Repetitive Patterns -- Intersection Non-Emptiness and Hardness within Polynomial Time -- Complexity of decision problems on totally rigid acyclic tree grammars -- A Pattern Logic for Automata with Outputs -- The Intersection Problem for Finite Semigroups -- On Completely Reachable Automata and Subset Reachability -- On Minimal Grammar Problems for Finite Languages -- Reversible Pushdown Transducers -- Two-way Automata and One-Tape Machines: Read Only versus Linear Time -- Dynamics of the Independence Number and Automata Synchronization -- Closest Substring Problems for Regular Languages -- Computational Complexity of Decision Problems on Self-Verifying Finite Automata -- Generalizations of Checking Stack Automata: Characterizations and Hierarchies -- On Counting Functions of Languages -- Towards exact state complexity bounds for input-driven pushdown automata -- On Abelian Subshifts -- Reachability Problems in Nondeterministic Polynomial Maps on the Integers -- Projection for Buchi Tree Automata with Constraints between Siblings -- The Computational Power of Parsing Expression Grammars -- On finitely ambiguous Buchi automata -- Uniformization Problem for Variants of First Order Logic over Finite Words -- On deterministic ordered restart-delete automata -- Complementation of Finitely Ambiguous Buchi Automata -- A Structural Lemma for Deterministic Context-Free Languages.
520 $a This book constitutes the proceedings of the 22nd International Conference on Developments in Language Theory, DLT 2018, held in Tokyo, Japan, in September 2018. The 39 full papers presented in this volume were carefully reviewed and selected from 84 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.
650 0 $a Formal languages $v Congresses. $3 443051
650 1 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 Computing Methodologies. $3 274528
650 2 4 $a Data Structures, Cryptology and Information Theory. $3 273993
650 2 4 $a Mathematics of Computing. $3 273710
700 1 $a Hoshi, Mizuho. $3 822024
700 1 $a Seki, Shinnosuke. $3 822025
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
830 0 $a Theoretical computer science and general issues. $3 822018
856 4 0 $u https://doi.org/10.1007/978-3-319-98654-8
950 $a Computer Science (Springer-11645)