Computational Parallels between the Regular and Context-Free Languages
From MaRDI portal
Publication:4151734
DOI10.1137/0207007zbMath0374.68046MaRDI QIDQ4151734
Harry B. III Hunt, Daniel J. Rosenkrantz
Publication date: 1978
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0207007
Related Items
On the index of positive programmed formal languages, Algebraic properties of substitution on trajectories, Observations on the complexity of regular expression problems, On the equivalence, containment, and covering problems for the regular and context-free languages, Complexity metatheorems for context-free grammar problems, Decidability of trajectory-based equations, Classifying the computational complexity of problems