One counter languages and the IRS condition (Q1218284)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	One counter languages and the IRS condition	scientific article

Statements

scholarly article

0 references

One counter languages and the IRS condition (English)

0 references

Journal of Computer and System Sciences

0 references

publication date

1975

0 references

Sheila A. Greibach

0 references

MaRDI profile type

MaRDI publication profile

0 references

Phrase structure languages, finite machines, and channel capacity

0 references

An analog of a theorem about context-free languages

0 references

0 references

On Relations Defined by Generalized Finite Automata

0 references

0 references

Derivation-bounded languages

0 references

Finite-Turn Pushdown Automata

0 references

Chains of full AFL's

0 references

Erasable context-free languages

0 references

An Infinite Hierarchy of Context-Free Languages

0 references

0 references

Linear Automaton Transformations

0 references

Transductions des langages de Chomsky

0 references

Inclusion relations among families of context-free languages

0 references

The inclusion of the substitution closure of linear and one-counter languages in the largest sub-AFL of the family of algebraic languages is proper

0 references

Erasing in context-free AFLs

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/S0022-0000(75)80042-0

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1218284

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1218284&oldid=34575565"