<journal article>
A SYMBOLIC CALCULUS OF REGULAR EXPRESSIONS
Creator | |
---|---|
Language | |
Publisher | |
Date | |
Source Title | |
Vol | |
Issue | |
First Page | |
Last Page | |
Publication Type | |
Access Rights | |
Crossref DOI | |
Related DOI | |
Related URI | |
Relation | |
Abstract | To implement Ginzburg's equality check procedure for regular expressions by using personal computers, we propose a new and more efficient axiom system consisting of an axiom and inference rules concer...ning a new relational symbol $ subset $ in addition to a part of Salomaa's axiom system.show more |
Hide fulltext details.
File | FileType | Size | Views | Description |
---|---|---|---|---|
p165 | 278 KB | 381 |
Details
PISSN | |
---|---|
NCID | |
Record ID | |
Peer-Reviewed | |
Type | |
Created Date | 2009.04.22 |
Modified Date | 2022.01.24 |