Tree adjunct grammars (Q1225947)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Tree adjunct grammars	scientific article

Statements

scholarly article

0 references

Tree adjunct grammars (English)

0 references

zbMATH Open document ID

0 references

10.1016/S0022-0000(75)80019-5

0 references

Aravind K. Joshi

0 references

0 references

Masako Takahashi

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

Indexed Grammars—An Extension of Context-Free Grammars

0 references

0 references

Tree generating regular systems

0 references

0 references

String adjunct grammars: II. Equational representation, null symbols, and linguistic relevance

0 references

0 references

A helpful result for proving inherent ambiguity

0 references

On Context-Free Languages

0 references

Mappings and grammars on trees

0 references

Characterizing derivation trees of context-free grammars through a generalization of finite automata theory

0 references

Generalized sequential machine maps

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1225947

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