On algebraic and logical specifications of classes of regular languages

Authors:
Bakhadyr Khoussainov
Affiliations:
Computer Science Department, The University of Auckland, Auckland, New Zealand
Venue:
Theoretical Computer Science - Australasian computer science
Year:
2003

Citing 5
Cited 0

Recursively enumerable sets and degrees

Recursively enumerable sets and degrees
Algebraic specifications of computable and semicomputable data types

Theoretical Computer Science
Algebraic specification

Handbook of theoretical computer science (vol. B)
Handbook of Formal Languages

Handbook of Formal Languages
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper studies classes of regular languages based on algebraic constraints imposed on transitions of automata and discusses issues related to specifications of these classes from algebraic, computational and logical points of view.