Anzeige
Erschienen in:
2009 | OriginalPaper | Buchkapitel
Permutation Languages in Formal Linguistics
verfasst von : Benedek Nagy
Erschienen in: Bio-Inspired Systems: Computational and Ambient Intelligence
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Derivations using branch-interchanging and the language family (
$\textbf{L}_{perm}$
) obtained by context-free and interchange (
AB
→
BA
) rules are analysed. This family is not closed under intersection with regular sets, therefore the obtained family of languages
$\textbf{L}_{perm \cap reg}$
is also interesting. Some non-trivial properties are shown. Important languages of mildly context-sensitive classes are shown to be belonging to
$\textbf{L}_{perm \cap reg}$
. Closure properties and other properties are detailed. Relations to partial and semi-commutations and to parallel processes are shown.