scientific article; zbMATH DE number 17550

zbMATH Open0756.68062MaRDI QIDQ3974875FDOQ3974875

Authors: Igor Litovsky 

Publication date: 26 June 1992

Title of this publication is not available (Why is that?)

Recommendations

• Developments in Language Theory
• Finitely generated bi\(\omega\)-languages
• Deciding whether a finite set of words has rank at most two
• Elementariness of a finite set of words is co-NP-complete
• MEMBERSHIP AND FINITENESS PROBLEMS FOR RATIONAL SETS OF REGULAR LANGUAGES

zbMATH Keywords

rational language

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (4)

• Elementariness of a finite set of words is co-NP-complete
• Prefix-free languages as \(\omega\)-generators
• Finitely generated bi\(\omega\)-languages
• Deciding whether a finite set of words has rank at most two

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3974875)