Partial algorithm problems for context free languages

DOI10.1016/S0019-9958(67)90401-9zbMath0155.34202OpenAlexW2026957673MaRDI QIDQ5536634

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

Related Items (6)

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

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