Approximate Nfa Universality Motivated by Information Theory

AuthID
 P-00X-4RQ
4
Author(s)
Mastnak, M
·
2
Editor(s)
Han,YS;Vaszil,G
Document Type
Proceedings Paper
Year published
2022
Published
in DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2022 in Lecture Notes in Computer Science, ISSN: 0302-9743
Volume: 13439, Pages: 142-154 (13)
Conference
24Th Ifip Wg 1.02 International Conference on Descriptional Complexity of Formal Systems (Dcfs), Date: AUG 29-31, 2022, Location: Univ Debrecen, Debrecen, HUNGARY, Sponsors: Int Federat Informat Proc, Working Grp 1 02 Descript Complex,Univ Debrecen, Fac Informat, Dept Comp Sci, Host: Univ Debrecen
Indexing
Wos®
Scopus®
Dblp®/en/publications/view/955159
Crossref®1
Google Scholar®
Publication Identifiers
DBLP: conf/dcfs/KonstantinidisM22
SCOPUS: 2-s2.0-85137041459
Wos: WOS:000877345300013
Source Identifiers
ISSN: 0302-9743
Export Publication Metadata
Marked List
 Add to Marked List
Info
At this moment we don't have any links to full text documens.

A place for researchers and their institutions

Useful Links

Get Help

© 2024 CRACS & Inesc TEC - All Rights Reserved Privacy Policy | Terms of Service