Languages generated by context-free grammars extended by type AB → BA rules

Authors:
Benedek Nagy
Affiliations:
Department of Computer Science, Faculty of Informatics, University of Debrecen, Debrecen, Hungary
Venue:
Journal of Automata, Languages and Combinatorics
Year:
2009

Citing 10
Cited 1

Formal languages

Formal languages
Extending context-free grammars with permutation phrases

ACM Letters on Programming Languages and Systems (LOPLAS)
Shuffle on trajectories: syntactic constraints

Theoretical Computer Science
On Context-Free Languages

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

Journal of the ACM (JACM)
Marcus Contextual Grammars

Marcus Contextual Grammars
Sequential grammars and automata with valances

Theoretical Computer Science
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
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

Permutation Languages in Formal Linguistics

IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part I: Bio-Inspired Systems: Computational and Ambient Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Derivations using branch-interchanging and language family obtained by context-free and interchange (AB → BA) rules are analyzed. This language family is between the context-free and context-sensitive families. Closure properties and other properties are detailed. Only semi-linear languages can be generated in this way. Relation to partial commutations is shown.