東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Descriptional complexity of formal s...

DCFS (Workshop) (2025 :)

Linked to FindBook

Google Book

Amazon

博客來

Descriptional complexity of formal systems = 26th IFIP WG 1.02 International Conference, DCFS 2025, Loughborough, UK, July 22-24, 2025 : proceedings /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Descriptional complexity of formal systems/ edited by Andreas Malcher, Luca Prigioniero.
Reminder of title:	26th IFIP WG 1.02 International Conference, DCFS 2025, Loughborough, UK, July 22-24, 2025 : proceedings /
remainder title:	DCFS 2025
other author:	Malcher, Andreas.
corporate name:	DCFS (Workshop)
Published:	Cham :Springer Nature Switzerland : : 2025.,
Description:	xxx, 225 p. :ill. (some col.), digital ;24 cm.
[NT 15003449]:	Fibonacci Pictures on a Binary Alphabet. -- A Close Analysis of the Subset Construction. -- k-local Graphs. -- Word-Representable Graphs and Locality of Words. -- Automata for Synchronised Shuffle on Backbones. -- Two-Word Shuffle: Some Results. -- Matrix Forbidding Grammars. -- On the Decidability and Expressive Power of Several Theories Based on String Constraints. -- Scattered Context Grammars with One Non-Context-Free Production and Six Nonterminals are Computationally Complete. -- Disjunctive Complexity. -- Two-Way Finite Automata with Translucent Input Letters. -- Relative Densities of Formal Languages. -- On A Measure for The Descriptional Complexity of Finite Automata with Translucent Words. -- What is the Most Natural Generalization of the Pumping Lemmas for Regular and Context-Free Languages?. -- Small Balanced Vertex Separators in NFA to Regular Expression Conversion.
Contained By:	Springer Nature eBook
Subject:	Formal languages - Congresses. -
Online resource:	https://doi.org/10.1007/978-3-031-97100-6
ISBN:	9783031971006

Descriptional complexity of formal systems = 26th IFIP WG 1.02 International Conference, DCFS 2025, Loughborough, UK, July 22-24, 2025 : proceedings /
Descriptional complexity of formal systems26th IFIP WG 1.02 International Conference, DCFS 2025, Loughborough, UK, July 22-24, 2025 : proceedings /[electronic resource] :DCFS 2025edited by Andreas Malcher, Luca Prigioniero. - Cham :Springer Nature Switzerland :2025. - xxx, 225 p. :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,157591611-3349 ;. - Lecture notes in computer science ;15759..

Fibonacci Pictures on a Binary Alphabet. -- A Close Analysis of the Subset Construction. -- k-local Graphs. -- Word-Representable Graphs and Locality of Words. -- Automata for Synchronised Shuffle on Backbones. -- Two-Word Shuffle: Some Results. -- Matrix Forbidding Grammars. -- On the Decidability and Expressive Power of Several Theories Based on String Constraints. -- Scattered Context Grammars with One Non-Context-Free Production and Six Nonterminals are Computationally Complete. -- Disjunctive Complexity. -- Two-Way Finite Automata with Translucent Input Letters. -- Relative Densities of Formal Languages. -- On A Measure for The Descriptional Complexity of Finite Automata with Translucent Words. -- What is the Most Natural Generalization of the Pumping Lemmas for Regular and Context-Free Languages?. -- Small Balanced Vertex Separators in NFA to Regular Expression Conversion.

This book constitutes the refereed proceedings of the 26th IFIP WG 1.02 International Conference on Descriptional Complexity of Formal Systems, DCFS 2025, held in Loughborough, UK, during July 22-24, 2025. This book includes 15 full papers, carefully reviewed and selected from 20 submissions, as well as 4 abstracts of the invited talks. The conference focus on all aspects of descriptional complexity, including automata, grammars, languages, and other formal systems; various modes of operations and complexity measures.

ISBN: 9783031971006

Standard No.: 10.1007/978-3-031-97100-6doiSubjects--Topical Terms:

546808
Formal languages
--Congresses.

LC Class. No.: QA267.3 / .D34 2025

Dewey Class. No.: 005.131

Descriptional complexity of formal systems = 26th IFIP WG 1.02 International Conference, DCFS 2025, Loughborough, UK, July 22-24, 2025 : proceedings /
LDR:02666nmm a2200361 a 4500 001 2413372
003 DE-He213
005 20250701130223.0
006 m d
007 cr nn 008maaau
008 260205s2025 sz s 0 eng d
020 $a 9783031971006 $q (electronic bk.)
020 $a 9783031970993 $q (paper)
024 7 $a 10.1007/978-3-031-97100-6 $2 doi
035 $a 978-3-031-97100-6
040 $a GP $c GP
041 0 $a eng
050 4 $a QA267.3 $b .D34 2025
072 7 $a UYA $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a UYA $2 thema
082 0 4 $a 005.131 $2 23
090 $a QA267.3 $b .D277 2025
111 2 $a DCFS (Workshop) $n (26th : $d 2025 : $c Loughborough, England) $3 3789398
245 1 0 $a Descriptional complexity of formal systems $h [electronic resource] : $b 26th IFIP WG 1.02 International Conference, DCFS 2025, Loughborough, UK, July 22-24, 2025 : proceedings / $c edited by Andreas Malcher, Luca Prigioniero.
246 3 $a DCFS 2025
260 $a Cham : $b Springer Nature Switzerland : $b Imprint: Springer, $c 2025.
300 $a xxx, 225 p. : $b ill. (some col.), digital ; $c 24 cm.
338 $a online resource $b cr $2 rdacarrier
490 1 $a Lecture notes in computer science, $x 1611-3349 ; $v 15759
505 0 $a Fibonacci Pictures on a Binary Alphabet. -- A Close Analysis of the Subset Construction. -- k-local Graphs. -- Word-Representable Graphs and Locality of Words. -- Automata for Synchronised Shuffle on Backbones. -- Two-Word Shuffle: Some Results. -- Matrix Forbidding Grammars. -- On the Decidability and Expressive Power of Several Theories Based on String Constraints. -- Scattered Context Grammars with One Non-Context-Free Production and Six Nonterminals are Computationally Complete. -- Disjunctive Complexity. -- Two-Way Finite Automata with Translucent Input Letters. -- Relative Densities of Formal Languages. -- On A Measure for The Descriptional Complexity of Finite Automata with Translucent Words. -- What is the Most Natural Generalization of the Pumping Lemmas for Regular and Context-Free Languages?. -- Small Balanced Vertex Separators in NFA to Regular Expression Conversion.
520 $a This book constitutes the refereed proceedings of the 26th IFIP WG 1.02 International Conference on Descriptional Complexity of Formal Systems, DCFS 2025, held in Loughborough, UK, during July 22-24, 2025. This book includes 15 full papers, carefully reviewed and selected from 20 submissions, as well as 4 abstracts of the invited talks. The conference focus on all aspects of descriptional complexity, including automata, grammars, languages, and other formal systems; various modes of operations and complexity measures.
650 0 $a Formal languages $v Congresses. $3 546808
650 0 $a Machine theory $v Congresses. $3 546807
650 0 $a Formal methods (Computer science) $v Congresses. $3 622707
650 1 4 $a Computer Science Logic and Foundations of Programming. $3 3538531
650 2 4 $a Computer Engineering and Networks. $3 3538504
650 2 4 $a Artificial Intelligence. $3 769149
700 1 $a Malcher, Andreas. $3 3789399
700 1 $a Prigioniero, Luca. $3 3789400
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 15759. $3 3789401
856 4 0 $u https://doi.org/10.1007/978-3-031-97100-6
950 $a Computer Science (SpringerNature-11645)