國立虎尾科技大學 |

Descriptional Complexity of Formal Systems = 24th IFIP WG 1.02 International Conference, DCFS 2022, Debrecen, Hungary, August 29–31, 2022, Proceedings /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Descriptional Complexity of Formal Systems/ edited by Yo-Sub Han, György Vaszil.
Reminder of title:	24th IFIP WG 1.02 International Conference, DCFS 2022, Debrecen, Hungary, August 29–31, 2022, Proceedings /
other author:	Han, Yo-Sub.
Description:	XXVIII, 213 p. 47 illus., 1 illus. in color.online resource. :
Contained By:	Springer Nature eBook
Subject:	Computer science. -
Online resource:	https://doi.org/10.1007/978-3-031-13257-5
ISBN:	9783031132575

Descriptional Complexity of Formal Systems = 24th IFIP WG 1.02 International Conference, DCFS 2022, Debrecen, Hungary, August 29–31, 2022, Proceedings /
Descriptional Complexity of Formal Systems24th IFIP WG 1.02 International Conference, DCFS 2022, Debrecen, Hungary, August 29–31, 2022, Proceedings /[electronic resource] :edited by Yo-Sub Han, György Vaszil. - 1st ed. 2022. - XXVIII, 213 p. 47 illus., 1 illus. in color.online resource. - Lecture Notes in Computer Science,134391611-3349 ;. - Lecture Notes in Computer Science,9324.

The Alphabetic Complexity in Homomorphic Definitions of Word, Tree and Picture Languages -- Ranking Binary Unlabelled Necklaces in Polynomial Time -- On the Power of Recursive Word-Functions without Concatenation -- Clusters of Repetition Roots Forming Prefix Chains -- Nearly k-Universal Words - Investigating a Part of Simon’s Congruence -- State Complexity of Binary Coded Regular Languages -- Reset Complexity and Completely Reachable Automata with Simple Idempotents -- On the Descriptional Complexity of the Direct Product of Finite Automata -- Operations on Subregular Languages and Nondeterministic State Complexity -- On Simon’s Congruence Closure of a String -- Approximate NFA Universality Motivated by Information Theory -- Lazy Regular Sensing -- State Complexity of Finite Partial Languages -- Yet Another Canonical Nondeterministic Automaton -- Union-Complexities of Kleene Plus Operation.

This book constitutes the proceedings of the 24th International Conference on Descriptional Complexity of Format Systems, DCFS 2022, which was supposed to take place in Debrecen, Hungary in August 2022. The 14 full papers presented in this volume were carefully reviewed and selected from 17 submissions. The book also contains 4 invited talks. The conference focus to all aspects of descriptional complexity including Automata, grammars, languages, and other formal systems; various modes of operations and complexity measures.

ISBN: 9783031132575

Standard No.: 10.1007/978-3-031-13257-5doiSubjects--Topical Terms:

573171
Computer science.

LC Class. No.: QA75.5-76.95

Dewey Class. No.: 004.0151

Descriptional Complexity of Formal Systems = 24th IFIP WG 1.02 International Conference, DCFS 2022, Debrecen, Hungary, August 29–31, 2022, Proceedings /
LDR:02953nam a22004095i 4500 001 1082205
003 DE-He213
005 20220731124807.0
007 cr nn 008mamaa
008 221228s2022 sz | s |||| 0|eng d
020 $a 9783031132575 $9 978-3-031-13257-5
024 7 $a 10.1007/978-3-031-13257-5 $2 doi
035 $a 978-3-031-13257-5
050 4 $a QA75.5-76.95
072 7 $a UYA $2 bicssc
072 7 $a COM051000 $2 bisacsh
072 7 $a UYA $2 thema
082 0 4 $a 004.0151 $2 23
245 1 0 $a Descriptional Complexity of Formal Systems $h [electronic resource] : $b 24th IFIP WG 1.02 International Conference, DCFS 2022, Debrecen, Hungary, August 29–31, 2022, Proceedings / $c edited by Yo-Sub Han, György Vaszil.
250 $a 1st ed. 2022.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2022.
300 $a XXVIII, 213 p. 47 illus., 1 illus. in color. $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 Lecture Notes in Computer Science, $x 1611-3349 ; $v 13439
505 0 $a The Alphabetic Complexity in Homomorphic Definitions of Word, Tree and Picture Languages -- Ranking Binary Unlabelled Necklaces in Polynomial Time -- On the Power of Recursive Word-Functions without Concatenation -- Clusters of Repetition Roots Forming Prefix Chains -- Nearly k-Universal Words - Investigating a Part of Simon’s Congruence -- State Complexity of Binary Coded Regular Languages -- Reset Complexity and Completely Reachable Automata with Simple Idempotents -- On the Descriptional Complexity of the Direct Product of Finite Automata -- Operations on Subregular Languages and Nondeterministic State Complexity -- On Simon’s Congruence Closure of a String -- Approximate NFA Universality Motivated by Information Theory -- Lazy Regular Sensing -- State Complexity of Finite Partial Languages -- Yet Another Canonical Nondeterministic Automaton -- Union-Complexities of Kleene Plus Operation.
520 $a This book constitutes the proceedings of the 24th International Conference on Descriptional Complexity of Format Systems, DCFS 2022, which was supposed to take place in Debrecen, Hungary in August 2022. The 14 full papers presented in this volume were carefully reviewed and selected from 17 submissions. The book also contains 4 invited talks. The conference focus to all aspects of descriptional complexity including Automata, grammars, languages, and other formal systems; various modes of operations and complexity measures.
650 0 $a Computer science. $3 573171
650 0 $a Computer engineering. $3 569006
650 0 $a Computer networks . $3 1365720
650 0 $a Artificial intelligence. $3 559380
650 1 4 $a Computer Science Logic and Foundations of Programming. $3 1365757
650 2 4 $a Computer Engineering and Networks. $3 1365733
650 2 4 $a Artificial Intelligence. $3 646849
700 1 $a Han, Yo-Sub. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1111290
700 1 $a Vaszil, György. $e editor. $1 https://orcid.org/0000-0003-1213-8616 $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1387791
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783031132568
776 0 8 $i Printed edition: $z 9783031132582
830 0 $a Lecture Notes in Computer Science, $x 0302-9743 ; $v 9324 $3 1258960
856 4 0 $u https://doi.org/10.1007/978-3-031-13257-5
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)