國立高雄大學圖資館 |

登入

回首頁

Descriptional complexity of formal systems24th IFIP WG 1.02 International Conference, DCFS 2022, Debrecen, Hungary, August 29-31, 2022 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Descriptional complexity of formal systemsedited by Yo-Sub Han, György Vaszil.
其他題名:	24th IFIP WG 1.02 International Conference, DCFS 2022, Debrecen, Hungary, August 29-31, 2022 : proceedings /
其他題名:	DCFS 2022
其他作者:	Han, Yo-Sub.
團體作者:
出版者:	Cham :Springer International Publishing :2022.
面頁冊數:	xxviii, 213 p. :ill., digital ;24 cm.
Contained By:	Springer Nature eBook
標題:	Formal languagesCongresses.
電子資源:	https://doi.org/10.1007/978-3-031-13257-5
ISBN:	9783031132575$q(electronic bk.)

Descriptional complexity of formal systems24th 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] :DCFS 2022edited by Yo-Sub Han, György Vaszil. - Cham :Springer International Publishing :2022. - xxviii, 213 p. :ill., digital ;24 cm. - Lecture notes in computer science,134391611-3349 ;. - Lecture notes in computer science ;4891..

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$q(electronic bk.)

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

443051
Formal languages
--Congresses.

LC Class. No.: QA267.3

Dewey Class. No.: 005.131

Descriptional complexity of formal systems24th IFIP WG 1.02 International Conference, DCFS 2022, Debrecen, Hungary, August 29-31, 2022 : proceedings /
LDR:02613nmm a2200349 a 4500 001 646204
003 DE-He213
005 20220731124807.0
006 m d
007 cr nn 008maaau
008 231219s2022 sz s 0 eng d
020 $a 9783031132575$q(electronic bk.)
020 $a 9783031132568$q(paper)
024 7 $a 10.1007/978-3-031-13257-5 $2 doi
035 $a 978-3-031-13257-5
040 $a GP $c GP
041 0 $a eng
050 4 $a QA267.3
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 .D277 2022
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
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, György Vaszil.
246 3 $a DCFS 2022
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2022.
300 $a xxviii, 213 p. : $b ill., digital ; $c 24 cm.
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 Formal languages $v Congresses. $3 443051
650 0 $a Machine theory $v Congresses. $3 442590
650 0 $a Formal methods (Computer science) $3 277520
650 1 4 $a Computer Science Logic and Foundations of Programming. $3 913141
650 2 4 $a Computer Engineering and Networks. $3 913124
650 2 4 $a Artificial Intelligence. $3 212515
700 1 $a Han, Yo-Sub. $3 753210
700 1 $a Vaszil, György. $3 955137
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
856 4 0 $u https://doi.org/10.1007/978-3-031-13257-5
950 $a Computer Science (SpringerNature-11645)