Algebraic Constraints, Automata, and Regular Languages (Revised)

Khoussainov, B

dc.contributor.author	Khoussainov, B	en
dc.date.accessioned	2009-04-16T23:18:24Z	en
dc.date.available	2009-04-16T23:18:24Z	en
dc.date.issued	2001-11	en
dc.identifier.citation	CDMTCS Research Reports CDMTCS-163 (2001)	en
dc.identifier.issn	1178-3540	en
dc.identifier.uri	http://hdl.handle.net/2292/3671	en
dc.description.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.	en
dc.publisher	Department of Computer Science, The University of Auckland, New Zealand	en
dc.relation.ispartofseries	CDMTCS Research Report Series	en
dc.rights.uri	https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm	en
dc.source.uri	http://www.cs.auckland.ac.nz/staff-cgi-bin/mjd/secondcgi.pl?serial	en
dc.title	Algebraic Constraints, Automata, and Regular Languages (Revised)	en
dc.type	Technical Report	en
dc.subject.marsden	Fields of Research::280000 Information, Computing and Communication Sciences	en
dc.rights.holder	The author(s)	en
dc.rights.accessrights	http://purl.org/eprint/accessRights/OpenAccess	en