scientific article
From MaRDI portal
Publication:3888558
zbMath0444.68072MaRDI QIDQ3888558
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) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items (9)
The complexity of PDL with interleaving ⋮ Answering regular path queries mediated by unrestricted \(\mathcal{SQ}\) ontologies ⋮ On the complexity of linearizability ⋮ Succinctness of regular expressions with interleaving, intersection and counting ⋮ Checking equivalences between concurrent systems of finite agents (Extended abstract) ⋮ Expressive capacity of subregular expressions ⋮ Deciding the inequivalence of context-free grammars with 1-letter terminal alphapet is \(\sum ^ p_ 2\)-complete ⋮ Reversible Kleene lattices ⋮ Computation paths logic: An expressive, yet elementary, process logic
This page was built for publication:
