Algebraic Constraints, Automata, and Regular Languages (Revised)

Algebraic Constraints, Automata, and Regular Languages (Revised)

Khoussainov, B
Identifier: http://hdl.handle.net/2292/3671
Issue Date: 2001-11
Reference: CDMTCS Research Reports CDMTCS-163 (2001)
Rights: The author(s)
Rights (URI): https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm

Abstract:

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

Show full item record

Files in this item

Icon
Name: 163bmk.pdf
Size: 309.1Kb
Format: PDF
Icon
Related URL: http://www.cs.auckland.ac.nz/staff-cgi-bin/mjd/secondcgi.pl?serial
Find Full text

This item appears in the following Collection(s)

Share

Search ResearchSpace


Browse

Statistics