Katalog der Deutschen Nationalbibliothek
Ergebnis der Suche nach: "{{{1}}}"
Treffer 95 von 7665567
|
|
| Link zu diesem Datensatz | https://d-nb.info/1374591106 |
| Titel | Implementation and Application of Automata : 29th International Conference, CIAA 2025, Palermo, Italy, September 22–25, 2025, Proceedings / edited by Giuseppa Castiglione, Sabrina Mantaci |
| Person(en) |
Castiglione, Giuseppa (Herausgeber) Mantaci, Sabrina (Herausgeber) |
| Organisation(en) | SpringerLink (Online service) (Sonstige) |
| Ausgabe | 1st ed. 2026 |
| Verlag | Cham : Springer Nature Switzerland, Imprint: Springer |
| Zeitliche Einordnung | Erscheinungsdatum: 2026 |
| Umfang/Format | Online-Ressource, XX, 332 p. 53 illus., 17 illus. in color. : online resource. |
| Andere Ausgabe(n) |
Printed edition:: ISBN: 978-3-032-02601-9 Printed edition:: ISBN: 978-3-032-02603-3 |
| Inhalt | -- Complementable Normal Form of Parametrized Automata. -- Toward the Glushkovization of Automata: the Strong Stabilization. -- Constructing Compact BPE Token DFAs. -- Epsilon Automata on Linear Orderings. -- Multi-entry DFA with reduced initial states to speedup parallel recognition. -- Two-Way Automata and Bounded Languages. -- An Algebraic Approach to the Equivalence Checking of Deterministic Top-down Tree Transducers. -- An active learning algorithm for bidirectional deterministic finite automata. -- Dynamically Weighted Tree Transducers. -- Engineering an LTLf Synthesis Tool. -- Subsequence Matching and Analysis Problems for Automata with Translucent Letters. -- Shape Preserving Tree Transducers. -- Simulating two-way nondeterministic finite automata over small alphabets by one-way nondeterministic automata. -- A New Approach for Showing Termination of Parameterized Transition Systems. -- An Earley-Based Universal Error-Correcting Parser. -- More on Language Families with a Decidable Pumping-Problem (Extended Abstract). -- Self-Verifying Predicates in B¨uchi Arithmetic. -- State-Freezing Pushdown Automata. -- From regular expressions to deterministic finite automata: $2ˆ\fracn}2}+\sqrtn}(\log n)ˆ\Theta(1)}}$ states are necessary and sufficient. -- A first taste of MeSCaL, a tool for solving membership problems for regular languages. -- In orbit with MeSCaL: higher in concatenation and navigational hierarchies of regular languages. -- A hierarchy of reversible finite automata |
| Persistent Identifier |
URN: urn:nbn:de:101:1-2508230408472.398176211633 DOI: 10.1007/978-3-032-02602-6 |
| URL | https://doi.org/10.1007/978-3-032-02602-6 |
| ISBN/Einband/Preis | 978-3-032-02602-6 |
| Sprache(n) | Englisch (eng) |
| Beziehungen | Lecture Notes in Computer Science ; 15981 |
| DDC-Notation | 004.01 (maschinell ermittelte DDC-Kurznotation) |
| Sachgruppe(n) | 004 Informatik |
| Online-Zugriff | Archivobjekt öffnen |
Treffer 95 von 7665567
Administration
