المؤلفون: Kwee, Kent, Otto, Friedrich

المساهمون: Universität Kassel Kassel, Giovanni Pighizzini, Cezar Câmpeanu, TC 1, WG 1.2

المصدر: Lecture Notes in Computer Science ; 19th International Conference on Descriptional Complexity of Formal Systems (DCFS) ; https://hal.inria.fr/hal-01656996 ; 19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. pp.226-237, ⟨10.1007/978-3-319-60252-3_18⟩

مصطلحات موضوعية: Restarting automaton, Ordered rewriting, Pumping lemma, Finiteness problem, [INFO]Computer Science [cs]

جغرافية الموضوع: Milano, Italy

Relation: hal-01656996; https://hal.inria.fr/hal-01656996; https://hal.inria.fr/hal-01656996/document; https://hal.inria.fr/hal-01656996/file/440206_1_En_18_Chapter.pdf

الاتاحة: https://hal.inria.fr/hal-01656996
https://hal.inria.fr/hal-01656996/document
https://hal.inria.fr/hal-01656996/file/440206_1_En_18_Chapter.pdf
https://doi.org/10.1007/978-3-319-60252-3_18

المؤلفون: Klimann, Ines, Picantin, Matthieu

المساهمون: Laboratoire d'informatique Algorithmique : Fondements et Applications (LIAFA), Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS)

المصدر: ISSN: 0302-9743 ; Lecture Notes in Computer Science ; LATIN 2014 ; 11th Latin American Theoretical INformatics Symposium (LATIN 2014) ; https://u-paris.hal.science/hal-00877087 ; 11th Latin American Theoretical INformatics Symposium (LATIN 2014), 2014, Uruguay. pp.180--189.

مصطلحات موضوعية: automaton groups, Mealy automata, finiteness problem, [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], [MATH.MATH-GR]Mathematics [math]/Group Theory [math.GR]

Relation: info:eu-repo/semantics/altIdentifier/arxiv/1310.7137; hal-00877087; https://u-paris.hal.science/hal-00877087; https://u-paris.hal.science/hal-00877087/document; https://u-paris.hal.science/hal-00877087/file/arxiv.pdf; ARXIV: 1310.7137

الاتاحة: https://u-paris.hal.science/hal-00877087
https://u-paris.hal.science/hal-00877087/document
https://u-paris.hal.science/hal-00877087/file/arxiv.pdf

المؤلفون: Detinko, A.S., Flannery, D.L., O'Brien, E.A.

مصطلحات موضوعية: matrix group, function field, finiteness problem, order problem, algorithm, function-fields

Relation: Journal of Algebra; Detinko, A.S. Flannery, D.L.; O'Brien, E.A. (2009). Deciding finiteness of matrix groups in positive characteristic. Journal of Algebra 322 (11), 4151-4160; http://hdl.handle.net/10379/11163

الاتاحة: http://hdl.handle.net/10379/11163
https://doi.org/10.1016/j.jalgebra.2009.08.020

المؤلفون: Detinko, A.S., Flannery, D.L.

مصطلحات موضوعية: matrix group, function field, finiteness problem, algorithm, function-fields

Relation: Journal of Symbolic Computation; Detinko, A.S. Flannery, D.L. (2009). On deciding finiteness of matrix groups. Journal of Symbolic Computation 44 (8), 1037-1043; http://hdl.handle.net/10379/11161

الاتاحة: http://hdl.handle.net/10379/11161
https://doi.org/10.1016/j.jsc.2009.02.001

المؤلفون: Matthieu Picantin, Ines Klimann

المساهمون: Laboratoire d'informatique Algorithmique : Fondements et Applications (LIAFA), Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS)

المصدر: Lecture Notes in Computer Science
LATIN 2014
11th Latin American Theoretical INformatics Symposium (LATIN 2014)
11th Latin American Theoretical INformatics Symposium (LATIN 2014), 2014, Uruguay. pp.180--189
LATIN 2014: Theoretical Informatics ISBN: 9783642544224
LATIN

مصطلحات موضوعية: FOS: Computer and information sciences, Discrete mathematics, Formal Languages and Automata Theory (cs.FL), 010102 general mathematics, Computer Science - Formal Languages and Automata Theory, Group Theory (math.GR), 0102 computer and information sciences, Directed graph, 01 natural sciences, [MATH.MATH-GR]Mathematics [math]/Group Theory [math.GR], law.invention, Automaton, finiteness problem, Invertible matrix, Mealy automata, [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], 010201 computation theory & mathematics, law, FOS: Mathematics, automaton groups, 0101 mathematics, Sink (computing), Mathematics - Group Theory, Mathematics

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f1954e7b27a9bd0080015f9d2b73888b
https://hal-univ-paris.archives-ouvertes.fr/hal-00877087/document

المؤلفون: Dane Flannery, Eamonn A. O'Brien, A. S. Detinko

مصطلحات موضوعية: Discrete mathematics, function-fields, order problem, Algebra and Number Theory, algorithm, Group (mathematics), 010102 general mathematics, Zero (complex analysis), Magma (algebra), matrix group, Field (mathematics), Group Theory (math.GR), 010103 numerical & computational mathematics, 01 natural sciences, finiteness problem, function field, Finite field, Matrix group, FOS: Mathematics, Order (group theory), 0101 mathematics, Mathematics - Group Theory, Function field, Mathematics

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4faaf1f9e7a4bab8c68526af8242f561
http://hdl.handle.net/10379/11163