scientific article
From MaRDI portal
Publication:3888559
zbMath0444.68073MaRDI QIDQ3888559
Publication date: 1980
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Free semigroups, generators and relations, word problems (20M05) Artificial intelligence (68T99) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items (5)
Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata ⋮ Synchronization of Parikh automata ⋮ Unnamed Item ⋮ On the Boundedness Property of Semilinear Sets ⋮ The Parikh Property for Weighted Context-Free Grammars
This page was built for publication:
