Canonical Decomposition of a Regular Factorial Language
| Autor: | Sergey Avgustinovich, Anna E. Frid |
|---|---|
| Rok vydání: | 2006 |
| Předmět: |
Combinatorics
Algebra Canonical decomposition Factorial ComputingMethodologies_SIMULATIONANDMODELING Computer Science::Programming Languages Physics::Accelerator Physics ComputerApplications_COMPUTERSINOTHERSYSTEMS Computer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing) High Energy Physics::Experiment Mathematics |
| Zdroj: | Computer Science – Theory and Applications ISBN: 9783540341666 CSR |
| DOI: | 10.1007/11753728_5 |
| Popis: | We consider decompositions of factorial languages to concatenations of factorial languages and prove that if the factorial language is regular, then so are the factors of its canonical decomposition. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|