scientific article; zbMATH DE number 1223708
From MaRDI portal
Publication:4219022
zbMath0909.68081MaRDI QIDQ4219022
Denis Thérien, Pascal Tesson, Jean-François Raymond
Publication date: 30 March 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (4)
On the Non-deterministic Communication Complexity of Regular Languages ⋮ Space Complexity of Reachability Testing in Labelled Graphs ⋮ Learning expressions and programs over monoids ⋮ Space complexity of reachability testing in labelled graphs
This page was built for publication:
