Descriptional Complexity of Formal Systems: 26th IFIP WG 1.02 International Conference, DCFS 2025, Loughborough,...

— —

Andreas Malcher Luca Prigioniero

Descriptional Complexity of Formal Systems

26th IFIP WG 1.02 International Conference, DCFS 2025, Loughborough, UK, July 22–24, 2025, Proceedings...

Andreas Malcher, Luca Prigioniero

$296.95 $237.35

Paperback

Not in-store but you can order this
How long will it take?

Availability Information

We source books from suppliers in Australia and overseas. For books we don't currently have in stock, the time it takes to get them from our suppliers can vary widely - from a few days to a few months - so we check each book with each supplier to determine the expected time it will take to be supplied to us.

We then advise you accordingly. If the time taken to get any book is too long for you, you can let us know and we will cancel or adjust your order, and refund as required.

To find out the anticipated arrival time for specific items prior to ordering, please contact us by phone or email:

Phone +61 2 9264 3111, or 1800 4 BOOKS (1800 4 26657) if outside Sydney:
option 1 Abbey's Bookshop (Crime, History, Science, Kids & more) • info@abbeys.com.au
option 2 Language Book Centre (ESL & Foreign Languages) • language@abbeys.com.au
option 3 Galaxy Bookshop (Sci-fi, Fantasy, Romance, Graphic Novels) • sf@galaxybooks.com.au

QTY:

English

Springer International Publishing AG
01 July 2025

Computer hardware; Mathematical theory of computation; Artificial intelligence

Series: Lecture Notes in Computer Science

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.

Edited by: Andreas Malcher, Luca Prigioniero
Imprint: Springer International Publishing AG
Country of Publication: Switzerland
Volume: 15759
Dimensions: Height: 235mm, Width: 155mm,
ISBN: 9783031970993
ISBN 10: 3031970993
Series: Lecture Notes in Computer Science
Pages: 225
Publication Date: 01 July 2025
Audience: Professional and scholarly , College/higher education , Undergraduate , Further / Higher Education
Format: Paperback
Publisher's Status: Active

.- 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.