scientific article; zbMATH DE number 2077108
From MaRDI portal
Publication:4470490
zbMath1044.68679MaRDI QIDQ4470490
François Lemieux, Hervé Caussinus
Publication date: 1 July 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Algebraic theory of languages and automata (68Q70)
Related Items (6)
Finite loops recognize exactly the regular open languages ⋮ Conservative groupoids recognize only regular languages ⋮ Space Complexity of Reachability Testing in Labelled Graphs ⋮ Languages recognized by finite aperiodic groupoids ⋮ Circuits and expressions with nonassociative gates ⋮ Space complexity of reachability testing in labelled graphs
This page was built for publication:
