Permutation Languages in Formal Linguistics

Authors:
Benedek Nagy
Affiliations:
Department of Computer Science, Faculty of Informatics, University of Debrecen, Debrecen, Debrecen, Hungary 4010
Venue:
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part I: Bio-Inspired Systems: Computational and Ambient Intelligence
Year:
2009

Citing 9
Cited 0

On permutative grammars generating context-free languages

BIT
Formal languages

Formal languages
Shuffle on trajectories: syntactic constraints

Theoretical Computer Science
Remarks about commutative context-free languages

Journal of Computer and System Sciences
Indexed Grammars—An Extension of Context-Free Grammars

Journal of the ACM (JACM)
Programmed Grammars and Classes of Formal Languages

Journal of the ACM (JACM)
Regulated Rewriting in Formal Language Theory

Regulated Rewriting in Formal Language Theory
Two optimal parallel algorithms on the commutation class of a word

Theoretical Computer Science - Words, languages and combinatorics
Languages generated by context-free grammars extended by type AB → BA rules

Journal of Automata, Languages and Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.