LEADER 04317nam  22007335  450 
001 9910741154203321
005 20230829134844.0
010   $a3-031-40247-2
024 7 $a10.1007/978-3-031-40247-0
035   $a(MiAaPQ)EBC30683595
035   $a(Au-PeEL)EBL30683595
035   $a(DE-He213)978-3-031-40247-0
035   $a(PPN)272260053
035   $a(CKB)27962347900041
035   $a(EXLCZ)9927962347900041
100   $a20230809d2023      u|         0
101 0 $aeng
135   $aurcnu||||||||
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 10$aImplementation and Application of Automata $e27th International Conference, CIAA 2023, Famagusta, North Cyprus, September 19?22, 2023, Proceedings /$fedited by Benedek Nagy
205   $a1st ed. 2023.
210  1$aCham :$cSpringer Nature Switzerland :$cImprint: Springer,$d2023.
215   $a1 online resource (313 pages)
225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v14151
311 08$aPrint version: Nagy, Benedek Implementation and Application of Automata Cham : Springer International Publishing AG,c2023 9783031402463 
320   $aIncludes bibliographical references and index.
327   $aFinite 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.
330   $aThis 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.
410  0$aLecture Notes in Computer Science,$x1611-3349 ;$v14151
606   $aComputer science
606   $aArtificial intelligence
606   $aInformation storage and retrieval systems
606   $aAlgorithms
606   $aComputer science$xMathematics
606   $aDiscrete mathematics
606   $aTheory of Computation
606   $aComputer Science Logic and Foundations of Programming
606   $aArtificial Intelligence
606   $aInformation Storage and Retrieval
606   $aAlgorithms
606   $aDiscrete Mathematics in Computer Science
615  0$aComputer science.
615  0$aArtificial intelligence.
615  0$aInformation storage and retrieval systems.
615  0$aAlgorithms.
615  0$aComputer science$xMathematics.
615  0$aDiscrete mathematics.
615 14$aTheory of Computation.
615 24$aComputer Science Logic and Foundations of Programming.
615 24$aArtificial Intelligence.
615 24$aInformation Storage and Retrieval.
615 24$aAlgorithms.
615 24$aDiscrete Mathematics in Computer Science.
676   $a511.3
702   $aNagy$b Benedek
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910741154203321
996   $aImplementation and Application of Automata$93552118
997   $aUNINA