×

Found 66 Documents (Results 1–66)

On Cobham’s theorem. (English) Zbl 07425662

Pin, Jean-Éric (ed.), Handbook of automata theory. Volume II. Automata in mathematics and selected applications. Berlin: European Mathematical Society (EMS). 947-986 (2021).
MSC:  68Q45
PDFBibTeX XMLCite
Full Text: DOI

An efficient algorithm to decide periodicity of \(b\)-recognisable sets using MSDF convention. (English) Zbl 1442.68082

Chatzigiannakis, Ioannis (ed.) et al., 44th international colloquium on automata, languages, and programming, ICALP 2017, Warsaw, Poland July 10–14, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 80, Article 118, 14 p. (2017).
MSC:  68Q45 11B85 20M35
PDFBibTeX XMLCite
Full Text: DOI arXiv

Developments in language theory. 21st international conference, DLT 2017, Liège, Belgium, August 7–11, 2017. Proceedings. (English) Zbl 1369.68016

Lecture Notes in Computer Science 10396. Cham: Springer (ISBN 978-3-319-62808-0/pbk; 978-3-319-62809-7/ebook). xxiii, 379 p. (2017).
MSC:  68-06 68Q45 00B25
PDFBibTeX XMLCite
Full Text: DOI

Preliminaries [to: Combinatorics, words and symbolic dynamics]. (English) Zbl 1404.11003

Berthé, Valérie (ed.) et al., Combinatorics, words and symbolic dynamics. Cambridge: Cambridge University Press (ISBN 978-1-107-07702-7/hbk; 978-1-139-92473-3/ebook). Encyclopedia of Mathematics and its Applications 159, 1-17, bibliography 443-463 (2016).
PDFBibTeX XMLCite
Full Text: DOI DOI

Formal languages, automata and numeration systems. Vol. 2. Applications to recognizability and decidability. (English) Zbl 1326.68003

Hoboken, NJ: John Wiley & Sons; London: ISTE (ISBN 978-1-84821-788-1/hbk; 978-1-119-04285-3/ebook). xix, 244 p. (2014).
PDFBibTeX XMLCite
Full Text: DOI

Formal languages, automata and numeration systems. Vol. 1. Introduction to combinatorics on words. (English) Zbl 1326.68002

Networks and Telecommunications Series. Hoboken, NJ: John Wiley & Sons; London: ISTE (ISBN 978-1-84821-615-0/hbk; 978-1-119-00820-0/ebook). xix, 301 p. (2014).
PDFBibTeX XMLCite
Full Text: DOI

Syntactic complexity of ultimately periodic sets of integers. (English) Zbl 1330.68178

Dediu, Adrian-Horia (ed.) et al., Language and automata theory and applications. 5th international conference, LATA 2011, Tarragona, Spain, May 26–31, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21253-6/pbk). Lecture Notes in Computer Science 6638, 477-488 (2011).
MSC:  68Q45 20M35 68R15
PDFBibTeX XMLCite
Full Text: DOI

State complexity of testing divisibility. (English) Zbl 1455.68085

McQuillan, Ian (ed.) et al., Twelfth annual workshop on descriptional complexity of formal systems, Saskatoon, Canada, August 8–10, 2010. Proceedings. Waterloo: Open Publishing Association (OPA). Electron. Proc. Theor. Comput. Sci. (EPTCS) 31, 48-57 (2010).
MSC:  68Q45 11Y16
PDFBibTeX XMLCite
Full Text: arXiv Link

On the periodicity of morphic words. (English) Zbl 1258.68079

Gao, Yuan (ed.) et al., Developments in language theory. 14th international conference, DLT 2010, London, ON, Canada, August 17–20, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-14454-7/pbk). Lecture Notes in Computer Science 6224, 209-217 (2010).
MSC:  68Q45 68W05
PDFBibTeX XMLCite
Full Text: DOI

Numeration systems: a link between number theory and formal language theory. (English) Zbl 1250.68177

Gao, Yuan (ed.) et al., Developments in language theory. 14th international conference, DLT 2010, London, ON, Canada, August 17–20, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-14454-7/pbk). Lecture Notes in Computer Science 6224, 33-53 (2010).
MSC:  68Q45 11B85
PDFBibTeX XMLCite
Full Text: DOI arXiv

On the recognizability of self-generating sets. (English) Zbl 1250.68164

Královič, Rastislav (ed.) et al., Mathematical foundations of computer science 2009. 34th international symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24–28, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03815-0/pbk). Lecture Notes in Computer Science 5734, 525-536 (2009).
MSC:  68Q45
PDFBibTeX XMLCite
Full Text: DOI

A decision problem for ultimately periodic sets in non-standard numeration systems. (English) Zbl 1173.68548

Ochmański, Edward (ed.) et al., Mathematical foundations of computer science 2008. 33rd international symposium, MFCS 2008, Toruń Poland, August 25–29, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-85237-7/pbk). Lecture Notes in Computer Science 5162, 241-252 (2008).
MSC:  68Q45 11A67
PDFBibTeX XMLCite
Full Text: DOI

Abstract numeration systems and tilings. (English) Zbl 1156.68443

Jędrzejowicz, Joanna (ed.) et al., Mathematical foundations of computer science 2005. 30th international symposium, MFCS 2005, Gdansk, Poland, August 29–September 2, 2005. Proceedings. Berlin: Springer (ISBN 3-540-28702-7/pbk). Lecture Notes in Computer Science 3618, 131-143 (2005).
MSC:  68Q45
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

Database

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software