Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

The inherent ambiguity partial algorithm problem for context free languages

From MaRDI portal
Publication:5402501
Jump to:navigation, search

DOI10.1145/800169.805417zbMath1282.68163OpenAlexW2038816610MaRDI QIDQ5402501

Joseph S. Ullian

Publication date: 14 March 2014

Published in: Proceedings of the first annual ACM symposium on Theory of computing - STOC '69 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/800169.805417



Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)








This page was built for publication: The inherent ambiguity partial algorithm problem for context free languages

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5402501&oldid=20136245"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 9 February 2024, at 01:40.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki