Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Edwin Hamel-de le Court"'
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 305, Iss Proc. GandALF 2019, Pp 154-168 (2019)
We investigate the state complexity of the star of symmetrical differences using modifiers and monsters. A monster is an automaton in which every function from states to states is represented by at least one letter. A modifier is a set of functions a
Externí odkaz:
https://doaj.org/article/faef02d69c9d46fe81ff029c6e026bab
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 22 no. 1, Iss Automata, Logic and Semantics (2020)
A monster is an automaton in which every function from states to states is represented by at least one letter. A modifier is a set of functions allowing one to transform a set of automata into one automaton. We revisit some language transformation al
Externí odkaz:
https://doaj.org/article/e07e275edcb34b56a3bd699e19acd64c
Publikováno v:
Information and Computation. 289:104961
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2faa2ac736627d16e9f3f645d80cadc3
https://doi.org/10.1016/j.ic.2022.104961
https://doi.org/10.1016/j.ic.2022.104961
Publikováno v:
Developments in Language Theory ISBN: 9783030485153
DLT
DLT
A modifier is a k-ary operator acting on DFAs and producing a DFA. Modifiers are involved in the theory of state complexity. We define and study a class of simple modifiers, called product modifiers, and we link closely the regular operations they en
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::316562ffcf6336339b8643a5f854e143
https://doi.org/10.1007/978-3-030-48516-0_9
https://doi.org/10.1007/978-3-030-48516-0_9
