Languages recognized by finite aperiodic groupoids

DOI10.1016/S0304-3975(97)00119-9zbMath0912.68110OpenAlexW2067317481MaRDI QIDQ1274931

Martin Beaudry

Publication date: 12 January 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(97)00119-9

zbMATH Keywords

groupoidcontext-free languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Conservative groupoids recognize only regular languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(NC^ 1\): The automata-theoretic viewpoint
• On pseudovarieties, varieties of languages, filters of congruences, pseudoidentities and related topics
• Extensions to Barrington's M-program model
• Circuits, matrices, and nonassociative computation
• Complexity of some problems from the theory of automata
• The membership problem in aperiodic transformation monoids
• The Hardest Context-Free Language
• Finite loops recognize exactly the regular open languages

This page was built for publication: Languages recognized by finite aperiodic groupoids