Conservative groupoids recognize only regular languages
From MaRDI portal
(Redirected from Publication:476161)
Recommendations
Cites work
- scientific article; zbMATH DE number 4034007 (Why is no real title available?)
- scientific article; zbMATH DE number 3615891 (Why is no real title available?)
- scientific article; zbMATH DE number 1944133 (Why is no real title available?)
- scientific article; zbMATH DE number 2077108 (Why is no real title available?)
- scientific article; zbMATH DE number 1546966 (Why is no real title available?)
- scientific article; zbMATH DE number 2102709 (Why is no real title available?)
- Algebraic automata and context-free sets
- Automata, Languages and Programming
- Classifying regular events in symbolic logic
- Finite loops recognize exactly the regular open languages
- First-order logic and star-free sets
- General context-free recognition in less than cubic time
- Languages recognized by finite aperiodic groupoids
- Polynomial closure and unambiguous product
- Representation of undirected graphs by anticommutative conservative groupoids
Cited in
(4)
This page was built for publication: Conservative groupoids recognize only regular languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q476161)