Conservative groupoids recognize only regular languages

DOI10.1016/J.IC.2014.08.005zbMATH Open1309.68132OpenAlexW1997591489MaRDI QIDQ476161FDOQ476161

Authors: Martin Beaudry, Danny Dubé, M. Dube, Mario Latendresse, Pascal Tesson 

Publication date: 28 November 2014

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2014.08.005

Recommendations

• Conservative groupoids recognize only regular languages
• Languages recognized by finite aperiodic groupoids
• Languages recognized by finite aperiodic groupoids
• Automata, Languages and Programming
• scientific article; zbMATH DE number 1688356

zbMATH Keywords

algebraic automata theorygroupoidconservative algebra

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70)

Cites Work

• Title not available (Why is that?)
• Classifying regular events in symbolic logic
• General context-free recognition in less than cubic time
• Title not available (Why is that?)
• First-order logic and star-free sets
• Polynomial closure and unambiguous product
• Title not available (Why is that?)
• Algebraic automata and context-free sets
• Languages recognized by finite aperiodic groupoids
• Title not available (Why is that?)
• Representation of undirected graphs by anticommutative conservative groupoids
• Title not available (Why is that?)
• Title not available (Why is that?)
• Finite loops recognize exactly the regular open languages
• Automata, Languages and Programming

Cited In (4)

• Automata, Languages and Programming
• Languages recognized by finite aperiodic groupoids
• Conservative groupoids recognize only regular languages
• Title not available (Why is that?)

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)