On algebraic and logical specifications of classes of regular languages.

DOI10.1016/S0304-3975(02)00812-5zbMATH Open1038.68076MaRDI QIDQ1874275FDOQ1874275

Bakhadyr Khoussainov

Publication date: 25 May 2003

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

zbMATH Keywords

AutomataHomomorphismIsomorphismUniversal algebraRegular language\(\sigma_1\)-algebra

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• ALGORITHMIC PROBLEMS IN VARIETIES
• Some Connections between Residual Finiteness, Finite Embeddability and the Word Problem
• Algebraic specifications of computable and semicomputable data types
• Randnomness, computability, and algebraic specifications
• Computability Theory and Its Applications

Cited In (6)

• An algebraic characterization of deterministic regular languages over infinite alphabets.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: On algebraic and logical specifications of classes of regular languages.

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