Zobrazeno 1 - 10
of 17
pro vyhledávání: '"Hellis Tamm"'
Autor:
Hendrik Maarand, Hellis Tamm
Publikováno v:
Descriptional Complexity of Formal Systems ISBN: 9783031132568
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::25f35d1470d40f3e46cf228559fe9952
https://doi.org/10.1007/978-3-031-13257-5_14
https://doi.org/10.1007/978-3-031-13257-5_14
Autor:
Hellis Tamm
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030549961
FM Workshops (2)
FM Workshops (2)
We consider several reversible finite automaton models which have been introduced over decades, and study some properties of their languages. In particular, we look at the question whether the quotients and atoms of a specific class of reversible lan
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e239abba53423921a1b52bdb11727806
https://doi.org/10.1007/978-3-030-54997-8_28
https://doi.org/10.1007/978-3-030-54997-8_28
Autor:
Margus Veanes, Hellis Tamm
Publikováno v:
SOFSEM 2018: Theory and Practice of Computer Science ISBN: 9783319731162
SOFSEM
SOFSEM
Symbolic finite automata extend classical automata by allowing infinite alphabets given by Boolean algebras and having transitions labeled by predicates over such algebras. Symbolic automata have been intensively studied recently and they have proven
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7fe3012b2ee56ebe9dbbd89ea0e8e38c
https://doi.org/10.1007/978-3-319-73117-9_30
https://doi.org/10.1007/978-3-319-73117-9_30
Autor:
Hellis Tamm, Janusz A. Brzozowski
Publikováno v:
International Journal of Foundations of Computer Science. 24:1009-1027
The quotient complexity of a regular language L, which is the same as its state complexity, is the number of left quotients of L. An atom of a non-empty regular language L with n quotients is a non-empty intersection of the n quotients, which can be
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::01460af07df98fdae8f600f06845e993
https://doi.org/10.1142/s0129054113400285
https://doi.org/10.1142/s0129054113400285
Autor:
Hellis Tamm
Publikováno v:
Descriptional Complexity of Formal Systems ISBN: 9783319192246
DCFS
DCFS
Residual finite state automata (RFSA) are a subclass of nondeterministic finite automata with the property that every state of an RFSA defines a residual language (a left quotient) of the language accepted by the RFSA. Every regular language has a un
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::67342e316129888a2a5d4f4c9e9e4578
https://doi.org/10.1007/978-3-319-19225-3_23
https://doi.org/10.1007/978-3-319-19225-3_23
Publikováno v:
Theoretical Computer Science. 363:234-246
We present a method for size reduction of two-way multitape automata. Our algorithm applies local transformations that change the order in which transitions concerning different tapes occur in the automaton graph, and merge suitable states into a sin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::df05862be2bf946a49d83823a00c5810
https://doi.org/10.1016/j.tcs.2006.07.027
https://doi.org/10.1016/j.tcs.2006.07.027
Autor:
Hellis Tamm, Esko Ukkonen
Publikováno v:
Theoretical Computer Science. 328:135-149
Bideterministic automata are deterministic automata with the property of their reversal automata also being deterministic. It has been known that a bideterministic automaton is the minimal deterministic automaton accepting its language. This paper sh
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d0e3a9af67a20bbc88a41b7ea9da8ff9
https://doi.org/10.1016/j.tcs.2004.07.010
https://doi.org/10.1016/j.tcs.2004.07.010
Publikováno v:
Information Systems. 28:311-337
Current data management and information retrieval systems lack advanced string processing capabilities needed in string-oriented application areas like computational molecular biology. Several theoretical models for string processing have been propos
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f388973b68e08cb1eb3b7c991df29a13
https://doi.org/10.1016/s0306-4379(02)00075-3
https://doi.org/10.1016/s0306-4379(02)00075-3
Publikováno v:
Descriptional Complexity of Formal Systems ISBN: 9783642316227
DCFS
DCFS
Recently, a characterization of the class of nondeterministic finite automata (NFAs) for which determinization results in a minimal deterministic finite automaton (DFA), was given in [2]. We present a similar result for the case of symmetric differen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::154015b9a13ecda6b2321a47e1d93802
https://doi.org/10.1007/978-3-642-31623-4_24
https://doi.org/10.1007/978-3-642-31623-4_24
Autor:
Janusz A. Brzozowski, Hellis Tamm
Publikováno v:
Developments in Language Theory ISBN: 9783642316524
Developments in Language Theory
Developments in Language Theory
An atom of a regular language L with n (left) quotients is a non-empty intersection of uncomplemented or complemented quotients of L, where each of the n quotients appears in a term of the intersection. The quotient complexity of L, which is the same
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0f0ae257cb75a0b16eecd70e84384d84
https://doi.org/10.1007/978-3-642-31653-1_6
https://doi.org/10.1007/978-3-642-31653-1_6