One counter languages and the IRS condition
type: Item
instance of: scholarly article
title: One counter languages and the IRS condition
zbMATH Open document ID: 0307.68062
DOI: 10.1016/S0022-0000(75)80042-0
published in: Journal of Computer and System Sciences
publication date: 1975-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 3481866
author: Sheila A. Greibach
MaRDI profile type: Publication
cites work: Phrase structure languages, finite machines, and channel capacity
cites work: An analog of a theorem about context-free languages
cites work: Q5526125
cites work: On Relations Defined by Generalized Finite Automata
cites work: Q4066625
cites work: Derivation-bounded languages
cites work: Finite-Turn Pushdown Automata
cites work: Chains of full AFL's
cites work: Erasable context-free languages
cites work: An Infinite Hierarchy of Context-Free Languages
cites work: Q4133152
cites work: Linear Automaton Transformations
cites work: Transductions des langages de Chomsky
cites work: Inclusion relations among families of context-free languages
cites work: 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
cites work: Erasing in context-free AFLs
description: scientific article; zbMATH DE number 3481866