國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Developments in language theory25th ...

(1998 :)

Developments in language theory25th International Conference DLT 2021, Porto, Portugal, August 16-20, 2021 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Developments in language theoryedited by Nelma Moreira, Rogerio Reis.
其他題名:	25th International Conference DLT 2021, Porto, Portugal, August 16-20, 2021 : proceedings /
其他題名:	DLT 2021
其他作者:	Moreira, Nelma.
團體作者:
出版者:	Cham :Springer International Publishing :2021.
面頁冊數:	xvii, 381 p. :ill. (some col.), digital ;24 cm.
Contained By:	Springer Nature eBook
標題:	Formal languagesCongresses.
電子資源:	https://doi.org/10.1007/978-3-030-81508-0
ISBN:	9783030815080$q(electronic bk.)

Developments in language theory25th International Conference DLT 2021, Porto, Portugal, August 16-20, 2021 : proceedings /
Developments in language theory25th International Conference DLT 2021, Porto, Portugal, August 16-20, 2021 : proceedings /[electronic resource] :DLT 2021edited by Nelma Moreira, Rogerio Reis. - Cham :Springer International Publishing :2021. - xvii, 381 p. :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,128110302-9743 ;. - Lecture notes in computer science ;4891..

Invited Talks -- Morphic sequences versus automatic sequences -- Parsimonious Computational Completeness Pointlike sets and separation: a personal perspective -- Regular Papers -- A strong non-overlapping Dyck code -- Active Learning of Sequential Transducers with Side Information about the Domain -- Compositions of Constant Weighted Extended Tree Transducers -- Extremal Binary PFAs in a Cerny Family -- Variations on the Post Correspondence Problem for Free Groups -- Reducing local alphabet size in recognizable picture languages -- Properties of Graphs Specified by a Regular Language -- Balanced-by-construction regular and omega-regular languages -- Weighted Prefix Normal Words: Mind the Gap -- Two-Way Non-Uniform Finite Automata -- Integer Weighted Automata on Infinite Words -- Deciding FO2 Alternation for Automata over Finite and Infinite Words -- State Complexity of Projection on Languages Recognized by Permutation Automata and Commuting Letters -- Constrained Synchronization and Subset Synchronization Problems for Weakly Acyclic Automata -- Lyndon words formalized in Isabelle/HOL -- The Range of State Complexities of Languages Resulting from the Cascade Product-The General Case (Extended Abstract) -- Second-order finite automata: expressive power and simple proofs using automatic structures -- Reversible Top-Down Syntax Analysis -- Symmetry groups of infinite words -- Bounded Languages Described by GF(2)-grammas -- Definability Results for Top-Down Tree Transducers -- The hardest LL(k) language -- Upper Bounds on Distinct Maximal (Sub-)Repetitions in Compressed Strings -- Branching Frequency and Markov Entropy of Repetition-Free Languages -- A Linear-time Simulation of Deterministic d-Limited Automata -- Caratheodory Extensions of Subclasses of Regular Languages -- Parikh Word Representable Graphs and Morphisms.

ISBN: 9783030815080$q(electronic bk.)

Standard No.: 10.1007/978-3-030-81508-0doiSubjects--Topical Terms:

443051
Formal languages
--Congresses.

LC Class. No.: QA267.3 / .C63 2021

Dewey Class. No.: 005.131

Developments in language theory25th International Conference DLT 2021, Porto, Portugal, August 16-20, 2021 : proceedings /
LDR:03067nmm a2200349 a 4500 001 616011
003 DE-He213
005 20220222171345.0
006 m d
007 cr nn 008maaau
008 220831s2021 sz s 0 eng d
020 $a 9783030815080$q(electronic bk.)
020 $a 9783030815073$q(paper)
024 7 $a 10.1007/978-3-030-81508-0 $2 doi
035 $a 978-3-030-81508-0
040 $a GP $c GP
041 0 $a eng
050 4 $a QA267.3 $b .C63 2021
072 7 $a UYA $2 bicssc
072 7 $a COM051000 $2 bisacsh
072 7 $a UYA $2 thema
082 0 4 $a 005.131 $2 23
090 $a QA267.3 $b .C748 2021
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
245 1 0 $a Developments in language theory $h [electronic resource] : $b 25th International Conference DLT 2021, Porto, Portugal, August 16-20, 2021 : proceedings / $c edited by Nelma Moreira, Rogerio Reis.
246 3 $a DLT 2021
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a xvii, 381 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 12811
490 1 $a Theoretical computer science and general issues
505 0 $a Invited Talks -- Morphic sequences versus automatic sequences -- Parsimonious Computational Completeness Pointlike sets and separation: a personal perspective -- Regular Papers -- A strong non-overlapping Dyck code -- Active Learning of Sequential Transducers with Side Information about the Domain -- Compositions of Constant Weighted Extended Tree Transducers -- Extremal Binary PFAs in a Cerny Family -- Variations on the Post Correspondence Problem for Free Groups -- Reducing local alphabet size in recognizable picture languages -- Properties of Graphs Specified by a Regular Language -- Balanced-by-construction regular and omega-regular languages -- Weighted Prefix Normal Words: Mind the Gap -- Two-Way Non-Uniform Finite Automata -- Integer Weighted Automata on Infinite Words -- Deciding FO2 Alternation for Automata over Finite and Infinite Words -- State Complexity of Projection on Languages Recognized by Permutation Automata and Commuting Letters -- Constrained Synchronization and Subset Synchronization Problems for Weakly Acyclic Automata -- Lyndon words formalized in Isabelle/HOL -- The Range of State Complexities of Languages Resulting from the Cascade Product-The General Case (Extended Abstract) -- Second-order finite automata: expressive power and simple proofs using automatic structures -- Reversible Top-Down Syntax Analysis -- Symmetry groups of infinite words -- Bounded Languages Described by GF(2)-grammas -- Definability Results for Top-Down Tree Transducers -- The hardest LL(k) language -- Upper Bounds on Distinct Maximal (Sub-)Repetitions in Compressed Strings -- Branching Frequency and Markov Entropy of Repetition-Free Languages -- A Linear-time Simulation of Deterministic d-Limited Automata -- Caratheodory Extensions of Subclasses of Regular Languages -- Parikh Word Representable Graphs and Morphisms.
650 0 $a Formal languages $v Congresses. $3 443051
650 1 4 $a Computer Science Logic and Foundations of Programming. $3 913141
650 2 4 $a Natural Language Processing (NLP) $3 826373
650 2 4 $a Formal Languages and Automata Theory. $3 914922
650 2 4 $a Logic in AI. $3 836108
650 2 4 $a Database Management. $3 273994
700 1 $a Moreira, Nelma. $3 569000
700 1 $a Reis, Rogerio. $3 569001
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
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-030-81508-0
950 $a Computer Science (SpringerNature-11645)