scientific article; zbMATH DE number 3612461
From MaRDI portal
Publication:4176990
zbMath0394.68054MaRDI QIDQ4176990
Publication date: 1978
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Equivalence ProblemFree MonoidDeterministic Chomsky LanguageRight Regular Finitely Generated EquivalencesSimple Grammars
Related Items (7)
Church-Rosser controlled rewriting systems and equivalence problems for deterministic context-free languages ⋮ A polynomial algorithm testing partial confluence of basic semi-Thue systems ⋮ Some decision problems about controlled rewriting systems ⋮ A characterisation of deterministic context-free languages by means of right-congruences ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A polynomial algorithm testing partial confluence of basic semi-Thue systems
This page was built for publication:
