One fast algorithm for finding automaton congruences
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F16%3A00301089" target="_blank" >RIV/68407700:21230/16:00301089 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
One fast algorithm for finding automaton congruences
Original language description
Even though congruences on a finite automaton play an important role when investigating the structure of a given automaton, not much attention has been given to finding a fast algorithm for constructing them. This contribution brings a fast algorithm for construction the smallest congruence containing a given relation, which can be used for finding elementary congruences, i.e. congruences merging two distinct states.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2016
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
APLIMAT 2016 - 15th Conference on Applied Mathematics 2016, Proceedings
ISBN
9788022745314
ISSN
—
e-ISSN
—
Number of pages
7
Pages from-to
248-254
Publisher name
Slovak University of Technology in Bratislava
Place of publication
Bratislava
Event location
Bratislava
Event date
Feb 2, 2016
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—