Languages recognized by finite aperiodic groupoids
From MaRDI portal
Recommendations
Cites work
- \(NC^ 1\): The automata-theoretic viewpoint
- Circuits, matrices, and nonassociative computation
- Complexity of some problems from the theory of automata
- Extensions to Barrington's M-program model
- Finite loops recognize exactly the regular open languages
- scientific article; zbMATH DE number 4037246 (Why is no real title available?)
- scientific article; zbMATH DE number 3654376 (Why is no real title available?)
- scientific article; zbMATH DE number 47663 (Why is no real title available?)
- scientific article; zbMATH DE number 3561239 (Why is no real title available?)
- scientific article; zbMATH DE number 2077108 (Why is no real title available?)
- On pseudovarieties, varieties of languages, filters of congruences, pseudoidentities and related topics
- The Hardest Context-Free Language
- The membership problem in aperiodic transformation monoids
Cited in
(9)- Aperiodic languages in concurrency monoids
- A language hierarchy and kitchens-type theorem for self-similar groups
- scientific article; zbMATH DE number 1688356 (Why is no real title available?)
- Conservative groupoids recognize only regular languages
- scientific article; zbMATH DE number 988805 (Why is no real title available?)
- Languages recognized by finite supersoluble groups
- Languages recognized by finite aperiodic groupoids
- Conservative groupoids recognize only regular languages
- Automata, Languages and Programming
This page was built for publication: Languages recognized by finite aperiodic groupoids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1274931)
