print

Yet another canonical nondeterministic automaton

author
Maarand, Hendrik
Tamm, Hellis
statement of authorship
Maarand, Hendrik, Tamm, Hellis
source
Descriptional Complexity of Formal Systems : 24th IFIP WG 1.02 International Conference, DCFS 2022, Debrecen, Hungary, August 29-31, 2022, proceedings
location of publication
Cham
publisher
Springer
year of publication
2022
pages
p. 184-196 : ill
series
Lecture notes in computer science ; 13439
conference name, date
4th IFIP WG 1.02 International Conference on Descriptional Complexity of Formal Systems, 29 - 31 August 2022
conference location
Debrecen
url
https://doi.org/10.1007/978-3-031-13257-5_14
subject term
regulaarsed keeled
tehisõpe
regulaarsed keeled
Scopus
Conference Proceedings at Scopus
Article at Scopus
WOS
Conference Proceedings at WOS
Article at WOS
kvartiil
Q3
category (general)
Computer science
Mathematics
category (sub)
Computer science. General computer science
Mathematics. Theoretical computer science
keyword
atoms of regular languages
automata learning
Canonical automaton
regular language
ISSN
0302-9743
ISBN
978-303113256-8
notes
Bibliogr.: 14 ref
Open Access
Open Access
scientific publication
teaduspublikatsioon
classifier
3.1
TTÜ department
tarkvarateaduse instituut
language
inglise
Uurimisrühm
High-assurance software laboratory
Maarand, H., Tamm, H. Yet another canonical nondeterministic automaton // Descriptional Complexity of Formal Systems : 24th IFIP WG 1.02 International Conference, DCFS 2022, Debrecen, Hungary, August 29-31, 2022, proceedings. Cham : Springer, 2022. p. 184-196 : ill. (Lecture notes in computer science ; 13439). https://doi.org/10.1007/978-3-031-13257-5_14