1 option
Descriptional Complexity of Formal Systems : 24th IFIP WG 1.02 International Conference, DCFS 2022, Debrecen, Hungary, August 29-31, 2022, Proceedings / edited by Yo-Sub Han, György Vaszil.
- Format:
- Book
- Series:
- Computer Science (SpringerNature-11645)
- Lecture notes in computer science 1611-3349 ; 13439
- Lecture Notes in Computer Science, 1611-3349 ; 13439
- Language:
- English
- Subjects (All):
- Computer science.
- Computer engineering.
- Computer networks.
- Artificial intelligence.
- Computer Science Logic and Foundations of Programming.
- Computer Engineering and Networks.
- Artificial Intelligence.
- Local Subjects:
- Computer Science Logic and Foundations of Programming.
- Computer Engineering and Networks.
- Artificial Intelligence.
- Physical Description:
- 1 online resource (XXVIII, 213 pages) : 47 illustrations, 1 illustrations in color.
- Edition:
- 1st ed. 2022.
- Contained In:
- Springer Nature eBook
- Place of Publication:
- Cham : Springer International Publishing : Imprint: Springer, 2022.
- System Details:
- text file PDF
- Summary:
- 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.
- Contents:
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-031-13257-5
- 9783031132575
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.