๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A characterization of reversal-bounded multipushdown machine languages

โœ Scribed by W. Rytter; M. Chrobak

Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
266 KB
Volume
36
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Reversal-bounded multipushdown machines
Reversal-bounded multipushdown machines
โœ Brenda S. Baker; Ronald V. Book ๐Ÿ“‚ Article ๐Ÿ“… 1974 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 1001 KB

Several representations of the recursively enumerable (r.e.) sets are presented. The first states that every r.e. set is the homomorphic image of the intersection of two linear context-free languages. The second states that every r.e. set is accepted by an on-line Turing acceptor with two pushdown s

A characterization of local regular lang
A characterization of local regular languages
โœ S.S. Yu ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 458 KB

As every non-empty word is a power of a unique primitive word, a set of primitive roots of a language is like an independent subset of a vector space. A language having finitely many primitive roots is called a local language. The purpose of this paper is to characterize local regular languages. We