المؤلفون: Giovanna J. Lavado, Giovanni Pighizzini, Luca Prigioniero

المصدر: Electronic Proceedings in Theoretical Computer Science, Vol 252, Iss Proc. AFL 2017, Pp 143-156 (2017)

مصطلحات موضوعية: Mathematics, QA1-939, Electronic computers. Computer science, QA75.5-76.95

وصف الملف: electronic resource

Relation: http://arxiv.org/pdf/1708.06465v1; https://doaj.org/toc/2075-2180

URL الوصول: https://doaj.org/article/a08f1c365e384c3e873cbadcd1a28de8

المؤلفون: Szilárd Zsolt Fazekas, Robert Mercas, Luca Prigioniero

مصطلحات موضوعية: One-way jumping finite automata (OWJFA)

Relation: 2134/27687336.v1

الاتاحة: https://figshare.com/articles/conference_contribution/Complexities_of_one-way_jumping_finite_automata/27687336

المؤلفون: Guilherme Duarte, Nelma Moreira, Luca Prigioniero, Rogério Reis

مصطلحات موضوعية: Block languages

Relation: 2134/27645756.v1; https://figshare.com/articles/conference_contribution/Operational_state_complexity_of_block_languages/27645756

الاتاحة: https://figshare.com/articles/conference_contribution/Operational_state_complexity_of_block_languages/27645756

المؤلفون: Giovanni Pighizzini, Luca Prigioniero

مصطلحات موضوعية: Automata

Relation: 2134/24894714.v1; https://figshare.com/articles/conference_contribution/Forgetting_1-limited_automata/24894714

الاتاحة: https://figshare.com/articles/conference_contribution/Forgetting_1-limited_automata/24894714

المؤلفون: Giovanni Pighizzini, Luca Prigioniero

مصطلحات موضوعية: Automata

Relation: 2134/24894717.v1; https://figshare.com/articles/conference_contribution/Once-marking_and_always-marking_1-limited_automata/24894717

الاتاحة: https://figshare.com/articles/conference_contribution/Once-marking_and_always-marking_1-limited_automata/24894717

المؤلفون: Giovanni Pighizzini, Luca Prigioniero, Šimon Sádovský

المساهمون: G. Pighizzini, L. Prigioniero, Š. Sádovský

مصطلحات موضوعية: descriptional complexity, limited automata, regular language, Settore INF/01 - Informatica

Relation: volume:27; issue:1-3; firstpage:229; lastpage:244; numberofpages:16; journal:JOURNAL OF AUTOMATA, LANGUAGES AND COMBINATORICS; https://hdl.handle.net/2434/939756; info:eu-repo/semantics/altIdentifier/scopus/2-s2.0-85130277752

الاتاحة: https://hdl.handle.net/2434/939756
https://doi.org/10.25596/jalc-2022-229

المؤلفون: Luca Prigioniero

المساهمون: L. Prigioniero

مصطلحات موضوعية: Regular language, descriptional complexity, finite automata, Settore INF/01 - Informatica

Relation: ispartofbook:27th IFIP WG 1.5 International Workshop on Cellular Automata and Discrete Complex Systems, AUTOMATA 2021, July 12-14, 2021, Aix-Marseille University, France; AUTOMATA; firstpage:1; lastpage:16; numberofpages:16; http://hdl.handle.net/2434/862333; info:eu-repo/semantics/altIdentifier/scopus/2-s2.0-85115851008

الاتاحة: http://hdl.handle.net/2434/862333
https://doi.org/10.4230/oasics.automata.2021.2

المؤلفون: Bogdan Aman, Gabriel Ciobanu, Robert Gl(, Robin Kaarsgaard, Jarkko Kari, Martin Kutrib, Ivan Lanese, Claudio Antares Mezzina (L)ukasz Mikulski, Rajagopal Nagarajan, Iain Phillips, G. Michele Pinna, Luca Prigioniero, Irek Ulidowski, Germ('a)n Vidal

المساهمون: Bogdan Aman, Irek Ulidowski, Ivan Lanese, Ulrik Pagh Schultz, Carla Ferreira, Aman, Bogdan, Ciobanu, Gabriel, Gl(, Robert, Kaarsgaard, Robin, Kari, Jarkko, Kutrib, Martin, Lanese, Ivan, Antares Mezzina (L)ukasz Mikulski, Claudio, Nagarajan, Rajagopal, Phillips, Iain, Michele Pinna, G., Prigioniero, Luca, Ulidowski, Irek, Vidal, Germ('a)n

مصطلحات موضوعية: Reversibility, Computability

Relation: info:eu-repo/semantics/altIdentifier/isbn/978-3-030-47361-7; info:eu-repo/semantics/altIdentifier/wos/WOS:000719283800023; ispartofbook:Reversible Computation: Extending Horizons of Computing. Selected Results of the COST Action IC1405; volume:12070; firstpage:1; lastpage:40; numberofpages:40; serie:LECTURE NOTES IN COMPUTER SCIENCE; alleditors:Irek Ulidowski, Ivan Lanese, Ulrik Pagh Schultz, Carla Ferreira; http://hdl.handle.net/11584/289972; info:eu-repo/semantics/altIdentifier/scopus/2-s2.0-85085494583; https://doi.org/10.1007/978-3-030-47361-7_1

الاتاحة: http://hdl.handle.net/11584/289972
https://doi.org/10.1007/978-3-030-47361-7_1

المؤلفون: Bruno Guillon, Giovanni Pighizzini, Luca Prigioniero, Daniel Průša

المساهمون: B. Guillon, G. Pighizzini, L. Prigioniero, D. Průša

مصطلحات موضوعية: cs.FL, 68Q45, F.4.3, F.1.1, Settore INF/01 - Informatica

Relation: numberofpages:23; http://hdl.handle.net/2434/921530; http://arxiv.org/abs/2103.05485v2

الاتاحة: http://hdl.handle.net/2434/921530
http://arxiv.org/abs/2103.05485v2

المؤلفون: Bruno Guillon, Giovanni Pighizzini, Luca Prigioniero, Daniel Průša

المساهمون: B. Guillon, G. Pighizzini, L. Prigioniero, D. Průša

مصطلحات موضوعية: Settore INF/01 - Informatica

Relation: numberofpages:23; http://hdl.handle.net/2434/921533; http://arxiv.org/abs/2103.05486v2

الاتاحة: http://hdl.handle.net/2434/921533
http://arxiv.org/abs/2103.05486v2

المؤلفون: Massimo Santini, Andrea Zubenko, Kristian Notari, Luca Prigioniero

Relation: https://github.com/let-unimi/liblet/tree/v1.6.4a0; https://doi.org/10.5281/zenodo.2619588; https://doi.org/10.5281/zenodo.10701839; oai:zenodo.org:10701839

الاتاحة: https://doi.org/10.5281/zenodo.10701839

المؤلفون: Giovanni Pighizzini, Luca Prigioniero

المساهمون: B. Nagy, G. Pighizzini, L. Prigioniero

مصطلحات موضوعية: Settore INF/01 - Informatica

Relation: info:eu-repo/semantics/altIdentifier/isbn/978-3-031-40246-3; info:eu-repo/semantics/altIdentifier/isbn/978-3-031-40247-0; ispartofbook:Implementation and Application of Automata; International Conference on Implementation and Application of Automata; volume:14151; firstpage:254; lastpage:265; numberofpages:12; serie:LECTURE NOTES IN COMPUTER SCIENCE; alleditors:B. Nagy; https://hdl.handle.net/2434/995629; info:eu-repo/semantics/altIdentifier/scopus/2-s2.0-85168589453

الاتاحة: https://hdl.handle.net/2434/995629
https://doi.org/10.1007/978-3-031-40247-0_19

المؤلفون: Savinien Kreczman, Luca Prigioniero, Eric Rowland, Manon Stipulanti

المساهمون: A. Frid, R. Mercaş, S. Kreczman, L. Prigioniero, E. Rowland, M. Stipulanti

مصطلحات موضوعية: Magic number, Periodic sequence, Automatic sequence, Regular sequence, Constant-recursive sequences, Settore INF/01 - Informatica

Relation: info:eu-repo/semantics/altIdentifier/isbn/978-3-031-33179-4; info:eu-repo/semantics/altIdentifier/isbn/978-3-031-33180-0; ispartofbook:Combinatorics on Words : 14th International Conference, WORDS 2023, Umeå, Sweden, June 12–16, 2023, Proceedings; International Conference WORDS 2023; volume:13899; firstpage:206; lastpage:219; numberofpages:14; serie:LECTURE NOTES IN COMPUTER SCIENCE; alleditors:A. Frid, R. Mercaş; https://hdl.handle.net/2434/979010; info:eu-repo/semantics/altIdentifier/scopus/2-s2.0-85173574063

الاتاحة: https://hdl.handle.net/2434/979010
https://doi.org/10.1007/978-3-031-33180-0_16

المؤلفون: Giovanni Pighizzini, Luca Prigioniero, Šimon Sádovský

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::a9e7b139d391c2926be605a05a7df2d1
https://doi.org/10.21203/rs.3.rs-2338203/v1

المؤلفون: Jozef Jirásek, Luca Prigioniero, Ian McQuillan, Oscar H. Ibarra

المصدر: Developments in Language Theory

مصطلحات موضوعية: FOS: Computer and information sciences, Space complexity, Formal Languages and Automata Theory (cs.FL), Computer science, Pushdown automaton, Computer Science - Formal Languages and Automata Theory, Parallel computing, Pushdown automata, Space (mathematics), Article, Automaton, Stack (abstract data type), Machine models, F.4.3, Stack automata, Computer Science (miscellaneous), Checking stack automata, Computer Science::Formal Languages and Automata Theory

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::35e1df19181463c44760fd2d571e9a1f
https://doi.org/10.1142/s0129054121420090

المؤلفون: Massimo Santini, Andrea Zubenko, Kristian Notari, Luca Prigioniero

Relation: https://github.com/let-unimi/liblet/tree/v1.6.1a0; https://doi.org/10.5281/zenodo.2619588; https://doi.org/10.5281/zenodo.7675748; oai:zenodo.org:7675748

الاتاحة: https://doi.org/10.5281/zenodo.7675748

المؤلفون: Bruno Guillon, Giovanni Pighizzini, Luca Prigioniero, Daniel Průša

المساهمون: Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes (LIMOS), Ecole Nationale Supérieure des Mines de St Etienne (ENSM ST-ETIENNE)-Centre National de la Recherche Scientifique (CNRS)-Université Clermont Auvergne (UCA)-Institut national polytechnique Clermont Auvergne (INP Clermont Auvergne), Université Clermont Auvergne (UCA)-Université Clermont Auvergne (UCA), Dipartimento di Informatica (ISLab), Università degli Studi di Milano = University of Milan (UNIMI), Czech Technical University in Prague (CTU), Université Clermont Auvergne (UCA), Institut national polytechnique Clermont Auvergne (INP Clermont Auvergne), Dipartimento di Informatica, Partially supported by Gruppo Nazionale per il Calcolo Scientifico (GNCS-INdAM).Supported by the Czech Science Foundation, grant 19-21198S

المصدر: Information and Computation
Information and Computation, 2022, 289 (Part A), pp.104938. ⟨10.1016/j.ic.2022.104938⟩

مصطلحات موضوعية: FOS: Computer and information sciences, TheoryofComputation_COMPUTATIONBYABSTRACTDEVICES, Formal Languages and Automata Theory (cs.FL), 68Q45, two-way automata, Computer Science - Formal Languages and Automata Theory, one-tape Turing machines, Computer Science Applications, Theoretical Computer Science, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, Computational Theory and Mathematics, F.4.3, F.1.1, Sakoda-Sipser conjecture, [INFO]Computer Science [cs], descriptional complexity, Computer Science::Formal Languages and Automata Theory, Information Systems

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c15a579d653965e768d140afa8d253c9
https://hal.science/hal-04093745

المؤلفون: Bruno Guillon, Giovanni Pighizzini, Luca Prigioniero, Daniel Průša

المساهمون: Université Clermont Auvergne (UCA), Institut national polytechnique Clermont Auvergne (INP Clermont Auvergne), Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes (LIMOS), Ecole Nationale Supérieure des Mines de St Etienne (ENSM ST-ETIENNE)-Centre National de la Recherche Scientifique (CNRS)-Université Clermont Auvergne (UCA)-Institut national polytechnique Clermont Auvergne (INP Clermont Auvergne), Université Clermont Auvergne (UCA)-Université Clermont Auvergne (UCA), Università degli Studi di Milano = University of Milan (UNIMI), Dipartimento di Informatica, Czech Technical University in Prague (CTU), Dipartimento di Informatica (ISLab)

المصدر: Information and Computation
Information and Computation, 2023, 292, pp.105030. ⟨10.1016/j.ic.2023.105030⟩

مصطلحات موضوعية: FOS: Computer and information sciences, TheoryofComputation_COMPUTATIONBYABSTRACTDEVICES, Formal Languages and Automata Theory (cs.FL), 68Q45, Descriptional complexity, Computer Science - Formal Languages and Automata Theory, Turing machines, one-tape Turing machines, Computer Science Applications, Theoretical Computer Science, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, Computational Theory and Mathematics, F.4.3, F.1.1, One-tape, [INFO]Computer Science [cs], Hennie machines, Computer Science::Formal Languages and Automata Theory, Information Systems

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7ebab2a18d86c3f5e0621dea068f10e3
https://doi.org/10.1016/j.ic.2023.105030

المؤلفون: Giovanni Pighizzini, Luca Prigioniero

المصدر: Fundamenta Informaticae. 180:103-122

مصطلحات موضوعية: TheoryofComputation_COMPUTATIONBYABSTRACTDEVICES, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, Algebra and Number Theory, Self-embedding, Theoretical computer science, Computational Theory and Mathematics, Rule-based machine translation, Computer science, Computer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing), Computer Science::Formal Languages and Automata Theory, Information Systems, Theoretical Computer Science

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::947f1d596fc3185a95639370a7ee56ca
https://doi.org/10.3233/fi-2021-2036

المؤلفون: Bruno Guillon, Giovanni Pighizzini, Luca Prigioniero

المساهمون: Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes (LIMOS), Ecole Nationale Supérieure des Mines de St Etienne (ENSM ST-ETIENNE)-Université Clermont Auvergne [2017-2020] (UCA [2017-2020])-Centre National de la Recherche Scientifique (CNRS), Dipartimento di Informatica (ISLab), Università degli Studi di Milano = University of Milan (UNIMI), Dipartimento di Informatica

المصدر: International Journal of Foundations of Computer Science
International Journal of Foundations of Computer Science, 2020, 31 (08), pp.1133-1157. ⟨10.1142/S0129054120420071⟩

مصطلحات موضوعية: TheoryofComputation_COMPUTATIONBYABSTRACTDEVICES, non-self-embedding grammars, Descriptional complexity, pushdown automata, Computer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing), 0102 computer and information sciences, 02 engineering and technology, Nonlinear Sciences::Cellular Automata and Lattice Gases, 01 natural sciences, regular languages, limited automata, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, 010201 computation theory & mathematics, 0202 electrical engineering, electronic engineering, information engineering, Computer Science (miscellaneous), context-free grammars, [INFO]Computer Science [cs], 020201 artificial intelligence & image processing, Computer Science::Formal Languages and Automata Theory

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d38940e2b58cb87d40d6368bf14b892c
https://doi.org/10.1142/s0129054120420071