scientific article
From MaRDI portal
Publication:3786001
zbMath0643.68119MaRDI QIDQ3786001
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
regular languagerewriting systemword lengthThue systemcomplexity of algorithmnon deterministic finite automatonset of descendants of regular set
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Abstract data types; algebraic specification (68Q65) Word problems, etc. in computability and recursion theory (03D40) Thue and Post systems, etc. (03D03)
Related Items (8)
Pointlike sets and separation: a personal perspective ⋮ Rational subsets of partially reversible monoids ⋮ Fixed points of endomorphisms of certain free products ⋮ On the rational subset problem for groups. ⋮ Fixed points of endomorphisms over special confluent rewriting systems. ⋮ On the semigroup rank of a group ⋮ Bottom-up rewriting for words and terms ⋮ Infinite periodic points of endomorphisms over special confluent rewriting systems
This page was built for publication:
