Abstract
A permutation rule is a non-context-free rule whose both sides contain the same multiset of symbols with at least one non-terminal. This rule does not add or substitute any symbols in the sentential form, but can be used to change the order of neighbouring symbols. In this paper, we consider regular and linear grammars extended with permutation rules. It is established that the generative power of these grammars relies not only on the length of the permutation rules, but also whether we allow or forbid the usage of erasing rules. This is quite surprising, since there is only one non-terminal in sentential forms of derivations for regular or linear grammars. Some decidability problems and closure properties of the generated families of languages are investigated. We also show a link to a similar model which mixes the symbols: grammars with jumping derivation mode.
Subject
Computer Science Applications,General Mathematics,Software
Reference15 articles.
1. Reversal-bounded multipushdown machines
2. Czerwinski W. and
Lasota S., Partially-commutative context-free languages, in
Proceedings Combined 19th International Workshop on Expressiveness in Concurrency and 9th Workshop on Structured Operational Semantics, EXPRESS/SOS 2012, Newcastle upon Tyne, UK, September 3, 2012, edited by
Luttik B. and
Reniers M.A.. Vol. 89 of EPTCS,
Open Publishing Association,
Waterloo
(2012) 35–48.
3. Characterization and complexity results on jumping finite automata
4. Hopcroft J.E.,
Motwani R. and
Ullman J.D., Introduction to Automata Theory, Languages, and Computation, 2nd edn.
Addison-Wesley Series in Computer Science.
Addison-Wesley-Longman,
MA
(2001)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献