Zobrazeno 1 - 10
of 41
pro vyhledávání: '"Tamm, Hellis"'
Publikováno v:
EPTCS 386, 2023, pp. 35-50
We associate lattices to the sets of unions and intersections of left and right quotients of a regular language. For both unions and intersections, we show that the lattices we produce using left and right quotients are dual to each other. We also gi
Externí odkaz:
http://arxiv.org/abs/2306.02491
Autor:
Maarand, Hendrik, Tamm, Hellis
Publikováno v:
In Theoretical Computer Science 27 June 2024 1001
Autor:
Brzozowski, Janusz, Tamm, Hellis
We examine the NFA minimization problem in terms of atomic NFA's, that is, NFA's in which the right language of every state is a union of atoms, where the atoms of a regular language are non-empty intersections of complemented and uncomplemented left
Externí odkaz:
http://arxiv.org/abs/1301.5585
Autor:
Brzozowski, Janusz, Tamm, Hellis
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:
http://arxiv.org/abs/1201.0295
Autor:
Brzozowski, Janusz, Tamm, Hellis
We show that every regular language defines a unique nondeterministic finite automaton (NFA), which we call "\'atomaton", whose states are the "atoms" of the language, that is, non-empty intersections of complemented or uncomplemented left quotients
Externí odkaz:
http://arxiv.org/abs/1102.3901
Autor:
Brzozowski, Janusz, Tamm, Hellis
Publikováno v:
In Theoretical Computer Science 19 June 2014 539:13-27
Autor:
Tamm, Hellis
We examine the role that atoms of regular languages play in boolean automata. We observe that the size of a minimal boolean automaton of a regular language is directly related to the number of atoms of the language. We present a method to construct m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::43dbfed9bdcf059a995dfbd20226d325
Publikováno v:
In Theoretical Computer Science 2006 363(2):234-246
Autor:
Tamm, Hellis *, Ukkonen, Esko
Publikováno v:
In Theoretical Computer Science 2004 328(1):135-149