One-relation languages and code generators

Tran, Vinh Duc; Litovsky, Igor

doi:10.1051/ita/2021002

RAIRO-Theor. Inf. Appl.

2021

DOI: 10.1051/ita/2021002

|View full text |Cite

One-relation languages and code generators

Vinh Duc Tran

Igor Litovsky

Abstract: We investigate the open problem to characterize whether the infinite power of a given language is generated by an ω-code. In case the given language is a code (i.e. zero-relation language), the problem was solved. In this work, we solve the problem for the class of one-relation languages.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

References 10 publications

(11 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

Set Decipherable Languages and Generators

Duc

2020

JCC

View full text Add to dashboard Cite

We investigate the problem to characterize whether the infinite product of a given language $L$ is generated by an $\omega$-code. Up to now, this problem is open even if language $L$ is a finite language.In this work, we consider a class of languages named $\omega$-set decipherable languages which are very close to the $\omega$-codes. We solve the problem in the restricted case where $L$ is $\omega$-set decipherable and $L^*$ is the greatest generator of $L^\omega$.

show abstract

Set Decipherable Languages and Generators

Duc

2020

JCC

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

hi@scite.ai

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

One-relation languages and code generators

Abstract: We investigate the open problem to characterize whether the infinite power of a given language is generated by an ω-code. In case the given language is a code (i.e. zero-relation language), the problem was solved. In this work, we solve the problem for the class of one-relation languages.

Cited by 1 publication

References 10 publications

Set Decipherable Languages and Generators

Set Decipherable Languages and Generators

Contact Info

Product

Resources

About