Computational Parallels between the Regular and Context-Free Languages
From MaRDI portal
Publication:4151734
DOI10.1137/0207007zbMath0374.68046OpenAlexW2002922589MaRDI QIDQ4151734
Daniel J. Rosenkrantz, Harry B. III Hunt
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 Boolean combinations forming piecewise testable languages, Algebraic properties of substitution on trajectories, On the undecidability and descriptional complexity of synchronized regular expressions, Observations on the complexity of regular expression problems, Classifying the computational complexity of problems, On the index of positive programmed formal languages, Decision problems for convex languages, Descriptional and computational complexity of finite automata -- a survey, Complexity of universality and related problems for partially ordered NFAs, On the equivalence, containment, and covering problems for the regular and context-free languages, Complexity metatheorems for context-free grammar problems, Descriptional and Computational Complexity of Finite Automata, Decision Problems for Convex Languages, Decidability of trajectory-based equations, More on Minimizing Finite Automata with Errors — Nondeterministic Machines