On a conjecture of Schnoebelen
Autor: | Jean-Eric Pin, Antonio Cano Gómez |
---|---|
Přispěvatelé: | Pin, Jean-Eric, Zoltán Ésik and Zoltán Fülöp, Departamento de Sistemas Informáticos y Computación [Valencia], Universitat Politècnica de València (UPV), Laboratoire d'informatique Algorithmique : Fondements et Applications (LIAFA), Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS) |
Jazyk: | angličtina |
Rok vydání: | 2003 |
Předmět: |
Discrete mathematics
Conjecture 68Q45 Group language Computer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing) 0102 computer and information sciences 02 engineering and technology [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM] 01 natural sciences shuffle product regular languages Set (abstract data type) conjecture of Schnoebelen [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM] Regular language 010201 computation theory & mathematics 0202 electrical engineering electronic engineering information engineering Decomposition (computer science) Computer Science::Programming Languages 020201 artificial intelligence & image processing Arithmetic Finite set Mathematics |
Zdroj: | Developments in language theory Developments in Language Theory ISBN: 9783540404347 Developments in Language Theory |
Popis: | The notion of sequential and parallel decomposition of a language over a set of languages was introduced by Schnoebelen. A language is decomposable if it belongs to a finite set of languages S such that each member of S admits a sequential and parallel decomposition over S. We disprove a conjecture of Schnoebelen concerning decomposable languages and establish some new properties of these languages. |
Databáze: | OpenAIRE |
Externí odkaz: |