Classifying regular languages by their syntactic algebras

DOI10.1007/3-540-58131-6_62MaRDI QIDQ6183619zbMATH OpenOpenAlexFDO

Authors Magnus Steinby

Publication date 29 January 2024

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-58131-6_62

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70)

Cites work

• scientific article; zbMATH DE number 3654376 (Why is no real title available?)
• scientific article; zbMATH DE number 3720983 (Why is no real title available?)
• scientific article; zbMATH DE number 3738924 (Why is no real title available?)
• scientific article; zbMATH DE number 3751028 (Why is no real title available?)
• scientific article; zbMATH DE number 51770 (Why is no real title available?)
• scientific article; zbMATH DE number 53545 (Why is no real title available?)
• scientific article; zbMATH DE number 3561239 (Why is no real title available?)
• scientific article; zbMATH DE number 475413 (Why is no real title available?)
• scientific article; zbMATH DE number 194781 (Why is no real title available?)
• On pseudovarieties, varieties of languages, filters of congruences, pseudoidentities and related topics
• Recognizable languages and congruences

This page was built for publication: Classifying regular languages by their syntactic algebras

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6183619)