Implementation and Application of Automata 27th International Conference, CIAA 2023, Famagusta, North Cyprus, September 19–22, 2023, Proceedings /

This book constitutes the proceedings of the 27th International Conference on Implementation and Application of Automata, CIAA 2023, held in Famagusta, North Cyprus, during September 19–22, 2023. The 20 regular papers presented in this book together with invited talks were carefully reviewed and sel...

Full beskrivning

Sparad:
Bibliografiska uppgifter
Institutionell upphovsman: SpringerLink (Online service)
Övriga upphovsmän: Nagy, Benedek (Utgivare, redaktör, sammanställare)
Materialtyp: Elektronisk E-bok
Språk:engelska
Publicerad: Cham : Springer Nature Switzerland : Imprint: Springer, 2023.
Upplaga:1st ed. 2023.
Serie:Lecture Notes in Computer Science, 14151
Ämnen:
Länkar:https://doi.org/10.1007/978-3-031-40247-0
Taggar: Lägg till en tagg
Inga taggar, Lägg till första taggen!

MARC

LEADER 00000nam a22000005i 4500
001 978-3-031-40247-0
003 DE-He213
005 20260810171037.0
007 cr nn 008mamaa
008 230809s2023 sz | o |||| 0|eng d
020 |a 9783031402470  |9 978-3-031-40247-0 
024 7 |a 10.1007/978-3-031-40247-0  |2 doi 
050 4 |a QA75.5-76.95 
072 7 |a UYA  |2 bicssc 
072 7 |a COM014000  |2 bisacsh 
072 7 |a UYA  |2 thema 
082 0 4 |a 004.0151  |2 23 
245 1 0 |a Implementation and Application of Automata  |h [electronic resource] :  |b 27th International Conference, CIAA 2023, Famagusta, North Cyprus, September 19–22, 2023, Proceedings /  |c edited by Benedek Nagy. 
250 |a 1st ed. 2023. 
264 1 |a Cham :  |b Springer Nature Switzerland :  |b Imprint: Springer,  |c 2023. 
300 |a 1 online resource (XII, 304 p. 81 illus.).  |b 16 illus. in color. 
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 14151 
505 0 |a Finite automata as verifiers -- Binary Coded Unary Regular Languages -- A Survey on Automata with Translucent Letters -- Earliest Query Answering for Deterministic Stepwise Hedge Automata -- Constrained Multi-Tildes -- On the smallest synchronizing terms of finite tree automata -- Universal First-Order Quantification over Automata -- Average Complexity of Partial Derivatives for Synchronised Shuffle Expressions -- Sweep complexity revisited -- The Pumping Lemma for Regular Languages is Hard -- M-equivalence of Parikh Matrix over a Ternary Alphabet -- Operational Complexity in Subregular Classes -- When Is Context-Freeness Distinguishable from Regularity? An Extension of Parikh's Theorem -- Enhanced Ternary Fibonacci Codes -- Sweeping Input-Driven Pushdown Automata -- Verified Verifying: SMT-LIB for Strings in Isabelle -- Weighted Bottom-up and Top-down Tree Transformations Are Incomparable -- Deciding whether an Attributed Translation can be realized by a Top-Down Transducer -- A time to cast away stones -- Two-way Machines and de Bruijn Words -- Transduction of Automatic Sequences and Applications -- Measuring Power of Generalised Definite Languages -- Smaller Representation of Compiled Regular Expressions. 
520 |a This book constitutes the proceedings of the 27th International Conference on Implementation and Application of Automata, CIAA 2023, held in Famagusta, North Cyprus, during September 19–22, 2023. The 20 regular papers presented in this book together with invited talks were carefully reviewed and selected from 30 submissions. The topics of the papers cover various fields in the application, implementation, and theory of automata and related structures. 
588 |a Print version record. 
650 0 |a Computer science. 
650 0 |a Artificial intelligence. 
650 0 |a Information storage and retrieval systems. 
650 0 |a Algorithms. 
650 0 |a Computer science  |x Mathematics. 
650 0 |a Discrete mathematics. 
650 1 4 |a Theory of Computation. 
650 2 4 |a Computer Science Logic and Foundations of Programming. 
650 2 4 |a Artificial Intelligence. 
650 2 4 |a Information Storage and Retrieval. 
650 2 4 |a Algorithms. 
650 2 4 |a Discrete Mathematics in Computer Science. 
700 1 |a Nagy, Benedek.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783031402463 
776 0 8 |i Printed edition:  |z 9783031402487 
830 0 |a Lecture Notes in Computer Science,  |x 1611-3349 ;  |v 14151 
856 4 0 |u https://doi.org/10.1007/978-3-031-40247-0 
912 |a ZDB-2-SCS 
912 |a ZDB-2-SXCS 
912 |a ZDB-2-SXPS 
912 |a ZDB-2-LNC 
950 |a Computer Science (SpringerNature-11645) 
950 |a Computer Science (R0) (SpringerNature-43710) 
950 |a Springer Nature Proceedings Computer Science (SpringerNature-85344)