Pith. sign in

REVIEW

On Languages Generated by Signed Grammars

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2309.08718 v1 pith:7JKESJMP submitted 2023-09-15 cs.FL

Ömer Eğecioğlu (Department of Computer Science , University of California , Santa Barbara , CA , USA) , Benedek Nagy (Department of Mathematics , Eastern Mediterranean University , North Cyprus
show 7 more authors
Mersin Turkey; Department of Computer Science Institute of Mathematics Informatics Eszterhazy Karoly Catholic University Eger Hungary)
This is my paper · ORCID
classification cs.FL
keywords grammarslanguagesformalgeneratedsignedsignsallowedassociated
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We consider languages defined by signed grammars which are similar to context-free grammars except productions with signs associated to them are allowed. As a consequence, the words generated also have signs. We use the structure of the formal series of yields of all derivation trees over such a grammar as a method of specifying a formal language and study properties of the resulting family of languages.

Discussion (0). Continue with ORCID to comment.

Pith tools