A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Formal languages and their relation to automata
Formal languages and their relation to automata
The Mathematical Theory of Context-Free Languages
The Mathematical Theory of Context-Free Languages
Time- and tape-bounded turing acceptors and AFLs
Journal of Computer and System Sciences
A Parallel Context-Free Derivation Hierarchy
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Complexity theory for splicing systems
Theoretical Computer Science
On the synchronized derivation depth of context-free grammars
Theoretical Computer Science
Information and Computation
Deterministic multitape automata computations
Journal of Computer and System Sciences
On the extension of Gladkij's Theorem and the Hierarchies of languages
Journal of Computer and System Sciences
Shrinking multi-pushdown automata
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Growing Grammars and Length-reducing Automata
Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
| Hi-index | 0.00 |
A slip language is a language whose Parikh mapping is a semilinear set. A slip family is a family containing only slip languages. The purpose of this paper is to study slip AFL. A sufficiency condition is given on a slip family which ensures that the ...