top

  Info

  • Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
Descriptional Complexity of Formal Systems [[electronic resource] ] : 25th IFIP WG 1.02 International Conference, DCFS 2023, Potsdam, Germany, July 4–6, 2023, Proceedings / / edited by Henning Bordihn, Nicholas Tran, György Vaszil
Descriptional Complexity of Formal Systems [[electronic resource] ] : 25th IFIP WG 1.02 International Conference, DCFS 2023, Potsdam, Germany, July 4–6, 2023, Proceedings / / edited by Henning Bordihn, Nicholas Tran, György Vaszil
Autore Bordihn Henning
Edizione [1st ed. 2023.]
Pubbl/distr/stampa Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023
Descrizione fisica 1 online resource (211 pages)
Disciplina 005.131
Altri autori (Persone) TranNicholas
VaszilGyörgy
Collana Lecture Notes in Computer Science
Soggetto topico Computer science
Computer engineering
Computer networks
Artificial intelligence
Computer Science Logic and Foundations of Programming
Computer Engineering and Networks
Artificial Intelligence
ISBN 3-031-34326-3
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Operational State Complexity Revisited: the Contribution of Monsters and Modifiers -- Hypercubes and Isometric Words based on Swap and Mismatch Distance -- Defying Gravity and Gadget Numerosity: The Complexity of the Hanano Puzzle -- Existential and Universal Width of Alternating Finite Automata -- On Jaffe’s Pumping Lemma, Revisited -- Operational Complexity: NFA-to-DFA Trade-Off -- The Word Problem for Finitary Automaton Groups -- Separating Words Problem over Groups -- Complexity of Exclusive Nondeterministic Finite Automata -- Shortest Accepted Strings for Two-Way Finite Automata: Approaching the Lower Bound -- Pushdown and One-Counter Automata: Constant and Non-Constant Memory Usage -- Construction of a Bi-Infinite Power Free Word with a Given Factor and a Non-Recurrent Letter -- Merging two Hierarchies of External Contextual Grammars with Subregular Selection -- A Tight Upper Bound on the Length of Maximal Bordered Box Repetition-Free Words.
Record Nr. UNINA-9910734866203321
Bordihn Henning  
Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Descriptional Complexity of Formal Systems [[electronic resource] ] : 25th IFIP WG 1.02 International Conference, DCFS 2023, Potsdam, Germany, July 4–6, 2023, Proceedings / / edited by Henning Bordihn, Nicholas Tran, György Vaszil
Descriptional Complexity of Formal Systems [[electronic resource] ] : 25th IFIP WG 1.02 International Conference, DCFS 2023, Potsdam, Germany, July 4–6, 2023, Proceedings / / edited by Henning Bordihn, Nicholas Tran, György Vaszil
Autore Bordihn Henning
Edizione [1st ed. 2023.]
Pubbl/distr/stampa Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023
Descrizione fisica 1 online resource (211 pages)
Disciplina 005.131
Altri autori (Persone) TranNicholas
VaszilGyörgy
Collana Lecture Notes in Computer Science
Soggetto topico Computer science
Computer engineering
Computer networks
Artificial intelligence
Computer Science Logic and Foundations of Programming
Computer Engineering and Networks
Artificial Intelligence
ISBN 3-031-34326-3
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Operational State Complexity Revisited: the Contribution of Monsters and Modifiers -- Hypercubes and Isometric Words based on Swap and Mismatch Distance -- Defying Gravity and Gadget Numerosity: The Complexity of the Hanano Puzzle -- Existential and Universal Width of Alternating Finite Automata -- On Jaffe’s Pumping Lemma, Revisited -- Operational Complexity: NFA-to-DFA Trade-Off -- The Word Problem for Finitary Automaton Groups -- Separating Words Problem over Groups -- Complexity of Exclusive Nondeterministic Finite Automata -- Shortest Accepted Strings for Two-Way Finite Automata: Approaching the Lower Bound -- Pushdown and One-Counter Automata: Constant and Non-Constant Memory Usage -- Construction of a Bi-Infinite Power Free Word with a Given Factor and a Non-Recurrent Letter -- Merging two Hierarchies of External Contextual Grammars with Subregular Selection -- A Tight Upper Bound on the Length of Maximal Bordered Box Repetition-Free Words.
Record Nr. UNISA-996538665803316
Bordihn Henning  
Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui