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.
Developments in Language Theory [[electronic resource] ] : 24th International Conference, DLT 2020, Tampa, FL, USA, May 11–15, 2020, Proceedings / / edited by Nataša Jonoska, Dmytro Savchuk
| Developments in Language Theory [[electronic resource] ] : 24th International Conference, DLT 2020, Tampa, FL, USA, May 11–15, 2020, Proceedings / / edited by Nataša Jonoska, Dmytro Savchuk |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (342 pages) |
| Disciplina | 511.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Natural language processing (Computer science) Computer science—Mathematics Computer networks Logic programming Computer Science Logic and Foundations of Programming Natural Language Processing (NLP) Mathematics of Computing Computer Communication Networks Logic in AI |
| ISBN | 3-030-48516-1 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Equational Theories of Scattered and Countable Series-parallel Posets -- Scattered Factor-Universality of Words -- On Normalish Subgroups of the R. Thompson’s Groups -- Computing the Shortest String and the Edit-Distance for Parsing Expression Languages -- An Approach to the Herzog-Schonheim Conjecture Using Automata -- On the Fine Grained Complexity of Finite Automata Non-Emptiness of Intersection -- The State Complexity of Lexicographically Smallest Words and Computing Successors -- Reconstructing Words from Right-Bounded-Block Words -- A Study of a Simple Class of Modifiers : Product Modifiers -- Operations on Permutation Automata -- Space Complexity of Stack Automata Models -- Descriptional Complexity of Semi-Simple Splicing Systems -- On the Degeneracy of Random Expressions Specified by Systems of Combinatorial Equations -- Dynamics of Cellular Automata on Beta-Shifts and Direct Topological Factorizations -- Avoidability of Additive Cubes over Alphabets of Four Numbers -- Equivalence of Linear Tree Transducers with Output in the Free Group -- On the Balancedness of Tree-to-word Transducers -- On Tree Substitution Grammars -- Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata -- Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices -- Avoiding 5/4-powers on the Alphabet of Nonnegative Integers (Extended Abstract) -- Transition Property for α-Power Free Languages with α ≥ 2 and k ≥ 3 Letters -- Context-Freeness of Word-MIX Languages -- The Characterization of the Minimal Paths in the Christoffel Tree According to a Second-order Balancedness. |
| Record Nr. | UNISA-996418318103316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Developments in Language Theory : 24th International Conference, DLT 2020, Tampa, FL, USA, May 11–15, 2020, Proceedings / / edited by Nataša Jonoska, Dmytro Savchuk
| Developments in Language Theory : 24th International Conference, DLT 2020, Tampa, FL, USA, May 11–15, 2020, Proceedings / / edited by Nataša Jonoska, Dmytro Savchuk |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (342 pages) |
| Disciplina |
511.3
005.131 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Natural language processing (Computer science) Computer science—Mathematics Computer networks Logic programming Computer Science Logic and Foundations of Programming Natural Language Processing (NLP) Mathematics of Computing Computer Communication Networks Logic in AI |
| ISBN | 3-030-48516-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Equational Theories of Scattered and Countable Series-parallel Posets -- Scattered Factor-Universality of Words -- On Normalish Subgroups of the R. Thompson’s Groups -- Computing the Shortest String and the Edit-Distance for Parsing Expression Languages -- An Approach to the Herzog-Schonheim Conjecture Using Automata -- On the Fine Grained Complexity of Finite Automata Non-Emptiness of Intersection -- The State Complexity of Lexicographically Smallest Words and Computing Successors -- Reconstructing Words from Right-Bounded-Block Words -- A Study of a Simple Class of Modifiers : Product Modifiers -- Operations on Permutation Automata -- Space Complexity of Stack Automata Models -- Descriptional Complexity of Semi-Simple Splicing Systems -- On the Degeneracy of Random Expressions Specified by Systems of Combinatorial Equations -- Dynamics of Cellular Automata on Beta-Shifts and Direct Topological Factorizations -- Avoidability of Additive Cubes over Alphabets of Four Numbers -- Equivalence of Linear Tree Transducers with Output in the Free Group -- On the Balancedness of Tree-to-word Transducers -- On Tree Substitution Grammars -- Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata -- Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices -- Avoiding 5/4-powers on the Alphabet of Nonnegative Integers (Extended Abstract) -- Transition Property for α-Power Free Languages with α ≥ 2 and k ≥ 3 Letters -- Context-Freeness of Word-MIX Languages -- The Characterization of the Minimal Paths in the Christoffel Tree According to a Second-order Balancedness. |
| Record Nr. | UNINA-9910409664703321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||