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

Multi-stack-counter languages

โœ Scribed by Ronald Book; Seymour Ginsburg


Book ID
105283294
Publisher
Springer
Year
1972
Tongue
English
Weight
815 KB
Volume
6
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


One-way weak-stack-counter automata
โœ Satoru Miyano ๐Ÿ“‚ Article ๐Ÿ“… 1980 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 994 KB
Type inference in stack based languages
โœ Bill Stoddart; Peter J. Knaggs ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Springer ๐ŸŒ English โš– 433 KB
Checking automata and one-way stack lang
โœ Sheila Greibach ๐Ÿ“‚ Article ๐Ÿ“… 1969 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 837 KB

A checking automaton is equivalent to a one-way nonerasing stack automaton which, once it enters its stack, never again writes on its stack. The checking automaton languages (cal) form a full AFL closed under substitution. If L C a\* is an infinite cal, then L contains an infinite regular set. Conse

Multi-pattern languages
โœ Lila Kari; Alexandru Mateescu; Gheorghe PวŽun; Arto Salomaa ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 1014 KB
Inference of deterministic one-counter l
โœ Josef Peter Heger; Juergen Heinz; Willi Kunz; Peter Ochsenschlaeger; Juergen Wat ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 1024 KB