- Publications
- Search
- Statistics
Approximate Nfa Universality Motivated by Information Theory
AuthID
P-00W-3MY
P-00W-3MY
4
Author(s)
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
Publication Identifiers
Dblp: conf/dcfs/KonstantinidisM22
Scopus: 2-s2.0-85137041459
Wos: WOS:000877345300013
Source Identifiers
ISSN: 0302-9743
Export Publication Metadata
Publication Export Settings
Marked List
Citations
Oops! It looks like you don't have access to this content.
This section is restricted to uses with b-on access.
CORE Conference
No information about CORE Rank
During the preprocessing phase, only publications of type 'Proceedings Paper' or 'Proceedings' are automatically processed to identify their CORE Rank.
TIP: If your publication's CORE Rank is missing, you can contact with your institutional manager to have the correct ranking manually added to the record.
Journal Factors
Oops! It looks like you don't have access to this content.
This section is restricted to uses with b-on access.
Info
At this moment we don't have any links to full text documens.