Proving containment of bounded AFL

DOI10.1016/S0022-0000(75)80048-1MaRDI QIDQ1230665zbMATH OpenFDO

Authors Branislav Rovan

Publication date 1975

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0022-0000(75)80048-1

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• Bounded Algol-Like Languages
• Bounded Regular Sets
• Characteristic and ultrarealtime languages
• Checking automata and one-way stack languages
• scientific article; zbMATH DE number 3483582 (Why is no real title available?)
• scientific article; zbMATH DE number 3293666 (Why is no real title available?)
• scientific article; zbMATH DE number 3397100 (Why is no real title available?)
• scientific article; zbMATH DE number 3060538 (Why is no real title available?)
• Images of AFL under certain families of homomorphisms
• Multi-stack-counter languages
• On Context-Free Languages
• Principal AFL
• Substitution and bounded languages
• Syntactic operators on full semiAFLs
• Three theorems concerning principal AFLs

Cited in

(1)

• scientific article; zbMATH DE number 3551930 (Why is no real title available?)

Describes a project that uses

Uses Software

• ALGOL 60

This page was built for publication: Proving containment of bounded AFL

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1230665)