scientific article; zbMATH DE number 3562527

zbMath0361.68078MaRDI QIDQ4134979

Thomas G. Szymanski, Harry B. III Hunt

Publication date: 1975

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (3)

Concise description of finite languages ⋮ On the equivalence, containment, and covering problems for the regular and context-free languages ⋮ A metatheorem for undecidable properties of formal languages and its application to LRR and LLR grammars and languages

This page was built for publication: