×

Found 942 Documents (Results 1–100)

Existential and universal width of alternating finite automata. (English) Zbl 07729457

Bordihn, Henning (ed.) et al., Descriptional complexity of formal systems. 25th IFIP WG 1.02 international conference, DCFS 2023, Potsdam, Germany, July 4–6, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13918, 51-64 (2023).
MSC:  68Qxx
PDF BibTeX XML Cite
Full Text: DOI

Nondeterministic state complexity of site-directed deletion. (English) Zbl 07572322

Caron, Pascal (ed.) et al., Implementation and application of automata. 26th international conference, CIAA 2022, Rouen, France, June 28 – July 1, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13266, 189-199 (2022).
MSC:  68Q45
PDF BibTeX XML Cite
Full Text: DOI

Introduction: advancing non-Archimedean mathematics. (English) Zbl 1504.30066

Zúñiga-Galindo, W. A. (ed.) et al., Advances in non-Archimedean analysis and applications. The \(p\)-adic methodology in STEAM-H. Cham: Springer. STEAM-H, Sci. Technol. Eng. Agric. Math. Health, 1-7 (2021).
MSC:  30G06
PDF BibTeX XML Cite
Full Text: DOI

Automata model for verifying attibuted-based access control policy in systems with a finite number of objects. (English. Russian original) Zbl 1487.68069

Mosc. Univ. Math. Bull. 76, No. 5, 230-233 (2021); translation from Vestn. Mosk. Univ., Ser. I 76, No. 5, 57-60 (2021).
MSC:  68M25 68Q45
PDF BibTeX XML Cite
Full Text: DOI

Groups defined by automata. (English) Zbl 07425660

Pin, Jean-Éric (ed.), Handbook of automata theory. Volume II. Automata in mathematics and selected applications. Berlin: European Mathematical Society (EMS). 871-911 (2021).
MSC:  20F10 68Q45 20F36
PDF BibTeX XML Cite
Full Text: DOI arXiv

Usefulness of information and unary languages. (English) Zbl 07405983

Leporati, Alberto (ed.) et al., Language and automata theory and applications. 15th international conference, LATA 2021, Milan, Italy, March 1–5, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12638, 131-142 (2021).
MSC:  68Q45
PDF BibTeX XML Cite
Full Text: DOI

Computational fun with sturdy and flimsy numbers. (English) Zbl 1515.68160

Farach-Colton, Martin (ed.) et al., 10th international conference on fun with algorithms. FUN 2021, May 30 – June 1, 2021, Favignana Island, Sicily, Italy. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 157, Article 10, 21 p. (2020).
MSC:  68Q45 11A63 68Q42
PDF BibTeX XML Cite
Full Text: DOI

Synchronizing words and monoid factorization: a parameterized perspective. (English) Zbl 1517.68142

Chen, Jianer (ed.) et al., Theory and applications of models of computation. 16th international conference, TAMC 2020, Changsha, China, October 18–20, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12337, 352-364 (2020).
MSC:  68Q27 68Q45
PDF BibTeX XML Cite
Full Text: DOI

Synchronizing deterministic push-down automata can be really hard. (English) Zbl 07559404

Esparza, Javier (ed.) et al., 45th international symposium on mathematical foundations of computer science, MFCS 2020, August 25–26, 2020, Prague, Czech Republic. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 170, Article 33, 15 p. (2020).
MSC:  68Qxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

From combinatorial games to shape-symmetric morphisms. (English) Zbl 1457.91116

Akiyama, Shigeki (ed.) et al., Substitution and tiling dynamics: introduction to self-inducing structures. Lecture notes from the research school on tiling dynamical systems, CIRM Jean-Morlet Chair, Marseille, France, Fall 2017. Cham: Springer. Lect. Notes Math. 2273, 227-291 (2020).
MSC:  91A46 91A68 68R15
PDF BibTeX XML Cite
Full Text: DOI Link

New results on semilinear sets and variants of jumping finite automata. (English) Zbl 1471.68003

Berlin: Logos Verlag; Gießen: Univ. Gießen, Fachbereich Mathematik und Informatik, Physik, Geographie (Diss.) (ISBN 978-3-8325-5210-7/pbk). xi, 232 p. (2020).
MSC:  68-02 68Q45 68Q70
PDF BibTeX XML Cite

Building a nest by an automaton. (English) Zbl 07525472

Bender, Michael A. (ed.) et al., 27th annual European symposium on algorithms, ESA 2019, Munich/Garching, Germany, September 9–11, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 144, Article 35, 14 p. (2019).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI

On the decidability of finding a positive ILP-instance in a regular set of ILP-instances. (English) Zbl 1434.68291

Hospodár, Michal (ed.) et al., Descriptional complexity of formal systems. 21st IFIP WG 1.02 international conference, DCFS 2019, Košice, Slovakia, July 17–19, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11612, 272-284 (2019).
MSC:  68Q45 03B25 90C10
PDF BibTeX XML Cite
Full Text: DOI

State complexity of single-word pattern matching in regular languages. (English) Zbl 1434.68238

Hospodár, Michal (ed.) et al., Descriptional complexity of formal systems. 21st IFIP WG 1.02 international conference, DCFS 2019, Košice, Slovakia, July 17–19, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11612, 86-97 (2019).
MSC:  68Q45
PDF BibTeX XML Cite
Full Text: DOI

Upper bounds on the imbalance of discrete functions implemented by sequences of finite automata. (English. Russian original) Zbl 1434.68223

Cybern. Syst. Anal. 55, No. 5, 752-759 (2019); translation from Kibern. Sist. Anal. 2019, No. 5, 58-66 (2019).
MSC:  68Q45 94A60
PDF BibTeX XML Cite
Full Text: DOI

Facet connectedness of arithmetic discrete hyperplanes with non-zero shift. (English) Zbl 07118245

Couprie, Michel (ed.) et al., Discrete geometry for computer imagery. 21st IAPR international conference, DGCI 2019, Marne-la-Vallée, France, March 26–28, 2019, Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11414, 38-50 (2019).
MSC:  68U05
PDF BibTeX XML Cite
Full Text: DOI

Partitioning a set of vectors with integer coordinates by means of logical hardware. (English. Russian original) Zbl 1443.68219

Cybern. Syst. Anal. 55, No. 3, 462-473 (2019); translation from Kibern. Sist. Anal. 2019, No. 3, 136-148 (2019).
PDF BibTeX XML Cite
Full Text: DOI

Finite-state techniques. Automata, transducers and bimachines. (English) Zbl 1465.68006

Cambridge Tracts in Theoretical Computer Science 60. Cambridge: Cambridge University Press (ISBN 978-1-108-48541-8/hbk; 978-1-108-75694-5/ebook). x, 304 p. (2019).
PDF BibTeX XML Cite
Full Text: DOI

Lagrange’s theorem for binary squares. (English) Zbl 1510.11168

Potapov, Igor (ed.) et al., 43rd international symposium on mathematical foundations of computer science. MFCS 2018, Liverpool, United Kingdom, August 27–31, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 117, Article 18, 14 p. (2018).
PDF BibTeX XML Cite
Full Text: DOI arXiv

Sums of palindromes: an approach via automata. (English) Zbl 1497.68277

Niedermeier, Rolf (ed.) et al., 35th symposium on theoretical aspects of computer science, STACS 2018, Caen, France, February 28 – March 3, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 96, Article 54, 12 p. (2018).
Reviewer: Amin Witno (Amman)
PDF BibTeX XML Cite
Full Text: DOI arXiv

Filter Results by …

Document Type

Reviewing State

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

Biographic Reference

all top 3

Software