Uniformly erasable AFL (Q1225462)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Uniformly erasable AFL	scientific article

Statements

scholarly article

0 references

Uniformly erasable AFL (English)

0 references

zbMATH Open document ID

0 references

10.1016/S0022-0000(75)80038-9

0 references

Seymour Ginsburg

0 references

Jonathan Goldstine

0 references

Sheila A. Greibach

0 references

Journal of Computer and System Sciences

0 references

publication date

1975

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

MaRDI profile type

MaRDI publication profile

0 references

Bracketed context-free languages

0 references

0 references

0 references

Finite-Turn Pushdown Automata

0 references

Control sets on grammars

0 references

Derivation-bounded languages

0 references

AFL with the semilinear property

0 references

An Infinite Hierarchy of Context-Free Languages

0 references

Checking automata and one-way stack languages

0 references

Chains of full AFL's

0 references

Erasable context-free languages

0 references

Erasing in context-free AFLs

0 references

0 references

A characterization of parenthesis languages

0 references

Transductions des langages de Chomsky

0 references

A helpful result for proving inherent ambiguity

0 references

Inclusion relations among families of context-free languages

0 references

full work available at URL

https://doi.org/10.1016/s0022-0000(75)80038-9

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1225462

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