Ambiguity and decision problems for local adjunct languages

DOI10.1016/S0022-0000(74)80019-XMaRDI QIDQ1843306zbMATH OpenOpenAlexFDO

Authors Johnson Murdoch Hart

Publication date 1974

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(74)80019-x

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• scientific article; zbMATH DE number 3174044 (Why is no real title available?)
• scientific article; zbMATH DE number 3238653 (Why is no real title available?)
• scientific article; zbMATH DE number 3254905 (Why is no real title available?)
• scientific article; zbMATH DE number 3293666 (Why is no real title available?)
• scientific article; zbMATH DE number 3310083 (Why is no real title available?)
• A variant of a recursively unsolvable problem
• Ambiguity in context free languages
• An infinite hierarchy of linear local adjunct languages
• Bounded Algol-Like Languages
• Finite-Turn Pushdown Automata
• On Context-Free Languages
• On The Ambiguity Problem of Backus Systems
• String adjunct grammars: I. Local and distributed adjunction
• Structural aspects of local adjunct languages
• The Unsolvability of the Recognition of Linear Context-Free Languages

Cited in

(1)

• Recursive generation of local adjunct languages

Describes a project that uses

Uses Software

• ALGOL 60

This page was built for publication: Ambiguity and decision problems for local adjunct languages

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