Zobrazeno 1 - 10
of 24
pro vyhledávání: '"S. R. Myers"'
Publikováno v:
ACM Transactions on Computational Logic. 20:1-47
For finite automata as coalgebras in a category C , we study languages they accept and varieties of such languages. This generalizes Eilenberg’s concept of a variety of languages, which corresponds to choosing as C the category of Boolean algebras.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9febb41197be6b4dcf69b2a7f11f9dc2
https://doi.org/10.1145/3276771
https://doi.org/10.1145/3276771
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030719944
FoSSaCS
FoSSaCS
We introduce a new measure on regular languages: their nondeterministic syntactic complexity. It is the least degree of any extension of the ‘canonical boolean representation’ of the syntactic monoid. Equivalently, it is the least number of state
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b7471ce00d9f5ebc9be8c18b66bbc9fc
https://doi.org/10.1007/978-3-030-71995-1_23
https://doi.org/10.1007/978-3-030-71995-1_23
Publikováno v:
Theoretical Computer Science. 604:81-101
For each regular language L we describe a family of canonical nondeterministic acceptors (nfas). Their construction follows a uniform recipe: build the minimal dfa for L in a locally finite variety V , and apply an equivalence between the category of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::41ba4e8af2f703d27a8dc190805867c0
https://doi.org/10.1016/j.tcs.2015.03.035
https://doi.org/10.1016/j.tcs.2015.03.035
Publikováno v:
MFPS
This paper is devoted to the study of nondeterministic closure automata, that is, nondeterministic finite automata (nfas) equipped with a strict closure operator on the set of states and continuous transition structure. We prove that for each regular
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3df9732a7f07ae2c4f291cacf9214aee
https://doi.org/10.1016/j.entcs.2014.10.002
https://doi.org/10.1016/j.entcs.2014.10.002
Publikováno v:
LICS
Eilenberg's variety theorem, a centerpiece of algebraic automata theory, establishes a bijective correspondence between varieties of languages and pseudovarieties of monoids. In the present paper this result is generalized to an abstract pair of alge
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::303f164f558a88fd577fd26088317f70
https://doi.org/10.1109/lics.2015.46
https://doi.org/10.1109/lics.2015.46
Publikováno v:
Advanced Information Systems Engineering ISBN: 9783642387081
CMCS
Lecture Notes in Computer Science
12th International Workshop on Coalgebraic Methods in Computer Science (CMCS)
12th International Workshop on Coalgebraic Methods in Computer Science (CMCS), Apr 2014, Grenoble, France. pp.189-210, ⟨10.1007/978-3-662-44124-4_11⟩
CMCS
Lecture Notes in Computer Science
12th International Workshop on Coalgebraic Methods in Computer Science (CMCS)
12th International Workshop on Coalgebraic Methods in Computer Science (CMCS), Apr 2014, Grenoble, France. pp.189-210, ⟨10.1007/978-3-662-44124-4_11⟩
Part 2: Regular Contributions; International audience; For each regular language L we describe a family of canonical nondeterministic acceptors (nfas). Their construction follows a uniform recipe: build the minimal dfa for L in a locally finite varie
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::28c6abea6df38eaabc836f6c17814770
https://doi.org/10.1007/978-3-662-44124-4_11
https://doi.org/10.1007/978-3-662-44124-4_11
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642548291
FoSSaCS
FoSSaCS
We investigate the duality between algebraic and coalgebraic recognition of languages to derive a generalization of the local version of Eilenberg’s theorem. This theorem states that the lattice of all boolean algebras of regular languages over an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ee11c0eed6eb86a27c26e3689348e40a
https://doi.org/10.1007/978-3-642-54830-7_24
https://doi.org/10.1007/978-3-642-54830-7_24
Autor:
S. R. Myers, F. E. Yakubu-Madus, W. T. Johnson, J. E. Baker, T. S. Cusick, V. K. Williams, F. C. Tinsley, A. Kriauciunas, J. Manetta, V. J. Chen
Publikováno v:
Diabetes. 46:637-642
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::46e69ae251d108fea7cef12e87c970b1
https://doi.org/10.2337/diabetes.46.4.637
https://doi.org/10.2337/diabetes.46.4.637
Autor:
Robert S. R. Myers, Henning Urbat
Publikováno v:
Descriptional Complexity of Formal Systems ISBN: 9783642393099
DCFS
DCFS
For each language \(L\subseteq{\textbf 2}^*\) and function t:ℕ → ℕ, we define another language \(t\ast L\subseteq{\textbf 2}^*\). We then prove that L ∈ NL/poly if and only if there exists k ∈ ℕ such that the projections \((n^k \ast L) \c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0a265fa22c853692ea2f288239482fbb
https://doi.org/10.1007/978-3-642-39310-5_19
https://doi.org/10.1007/978-3-642-39310-5_19
Publikováno v:
Diabetes. 45:1805-1813
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d20a8175df6db526d506a13df4a58f8e
https://doi.org/10.2337/diabetes.45.12.1805
https://doi.org/10.2337/diabetes.45.12.1805