Partial algorithm problems for context free languages

DOI10.1016/S0019-9958(67)90401-9MaRDI QIDQ5536634zbMATH OpenOpenAlexFDO

Authors Joseph S. Ullian

Publication date 1967

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0019-9958(67)90401-9

zbMATH Keywords

mathematical logic

Cited in

(7)

• Theory of formal grammars
• Strongly Regular Grammars and Regular Approximation of Context-Free Languages
• Monadic Thue systems
• THE DESIGN PRINCIPLES AND ALGORITHMS OF A WEIGHTED GRAMMAR LIBRARY
• The decidability of a mapping problem for generalized sequential machines with final states
• Complexity classes of partial recursive functions
• On the intersection problem for quantum finite automata

This page was built for publication: Partial algorithm problems for context free languages

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