Ambiguity and decision problems for local adjunct languages

DOI10.1016/S0022-0000(74)80019-XzbMath0281.68038OpenAlexW2089746349MaRDI QIDQ1843306

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)

Related Items (1)

Recursive generation of local adjunct languages

Uses Software

• ALGOL 60

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An infinite hierarchy of linear local adjunct languages
• Structural aspects of local adjunct languages
• Ambiguity in context free languages
• Bounded Algol-Like Languages
• Finite-Turn Pushdown Automata
• The Unsolvability of the Recognition of Linear Context-Free Languages
• On Context-Free Languages
• String adjunct grammars: I. Local and distributed adjunction
• On The Ambiguity Problem of Backus Systems
• A variant of a recursively unsolvable problem

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