×

Found 137 Documents (Results 1–100)

100
MathJax

On the values for factor complexity. (English) Zbl 06974640

Câmpeanu, Cezar (ed.), Implementation and application of automata. 23rd international conference, CIAA 2018, Charlottetown, PE, Canada, July 30 – August 2, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10977, 274-285 (2018).
MSC:  68Q45
PDF BibTeX XML Cite
Full Text: DOI

Bounds on the Kolmogorov complexity function for infinite words. (English) Zbl 1390.68359

Burgin, Mark (ed.) et al., Information and complexity. Hackensack, NJ: World Scientific (ISBN 978-981-3109-02-5/hbk; 978-981-3109-04-9/ebook). World Scientific Series in Information Studies 6, 200-224 (2017).
MSC:  68Q30 03D32
PDF BibTeX XML Cite
Full Text: DOI Link

Going beyond Turing with P automata: partial adult halting and regular observer \(\omega\)-languages. (English) Zbl 1465.68082

Calude, S. (ed.) et al., Unconventional computation and natural computation. 14th international conference, UCNC 2015, Auckland, New Zealand, August 30 – September 3, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9252, 169-180 (2015).
MSC:  68Q07 68Q45
PDF BibTeX XML Cite
Full Text: DOI

Finite state incompressible infinite sequences. (English) Zbl 1405.68147

Gopal, T. V. (ed.) et al., Theory and applications of models of computation. 11th annual conference, TAMC 2014, Chennai, India, April 11–13, 2014. Proceedings. Berlin: Springer (ISBN 978-3-319-06088-0/pbk). Lecture Notes in Computer Science 8402, 50-66 (2014).
MSC:  68Q30 68Q45
PDF BibTeX XML Cite
Full Text: DOI

A correspondence principle for exact constructive dimension. (English) Zbl 1358.68150

Cooper, S. Barry (ed.) et al., How the world computes. Turing centenary conference and 8th conference on computability in Europe, CiE 2012, Cambridge, UK, June 18–23, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-30869-7/pbk). Lecture Notes in Computer Science 7318, 686-695 (2012).
MSC:  68Q30
PDF BibTeX XML Cite
Full Text: DOI

On oscillation-free Chaitin \(h\)-random sequences. (English) Zbl 1262.03069

Dinneen, Michael J. (ed.) et al., Computation, physics and beyond. International workshop on theoretical computer science, WTCS 2012, dedicated to Cristian S. Calude on the occasion of his 60th birthday, Auckland, New Zealand, February 21–24, 2012. Revised selected and invited papers. Berlin: Springer (ISBN 978-3-642-27653-8/pbk). Lecture Notes in Computer Science 7160, 194-202 (2012).
MSC:  03D32
PDF BibTeX XML Cite
Full Text: DOI

From error-correcting codes to algorithmic information theory. (English) Zbl 1234.68163

Zenil, Hector (ed.), Randomness through computation. Some answers, more questions. Hackensack, NJ: World Scientific (ISBN 978-981-4327-74-9/hbk; 978-981-4327-75-6/ebook). 293-296 (2011).
MSC:  68Q30 68Q87
PDF BibTeX XML Cite
Full Text: Link

Constructive dimension and Hausdorff dimension: the case of exact dimension. (English) Zbl 1342.68173

Owe, Olaf (ed.) et al., Fundamentals of computation theory. 18th international symposium, FCT 2011, Oslo, Norway, August 22–25, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22952-7/pbk). Lecture Notes in Computer Science 6914, 252-263 (2011).
MSC:  68Q30
PDF BibTeX XML Cite
Full Text: DOI

The maximal subword complexity of quasiperiodic infinite words. (English) Zbl 1455.68155

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, 169-176 (2010).
MSC:  68R15 68Q45
PDF BibTeX XML Cite
Full Text: arXiv Link

Topologies refining the Cantor topology on \(X^\omega\). (English) Zbl 1198.68162

Calude, Christian S. (ed.) et al., Theoretical computer science. 6th IFIP WG 2.2 international conference, TCS 2010, held as a Part of the World Computer Congress (WCC 2010), Brisbane, Australia, September 20–23, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15239-9/hbk; 978-3-642-15240-5/ebook). IFIP Advances in Information and Communication Technology 323, 271-285 (2010).
MSC:  68Q45 68Q87
PDF BibTeX XML Cite
Full Text: DOI

On oscillation-free epsilon-random sequences. II. (English) Zbl 1247.03086

Bauer, Andrej (ed.) et al., 6th international conference on computability and complexity in analysis (CCA’09). Proceedings of the international conference, August 18–22, 2009, Ljubljana, Slovenia. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-12-5). OASIcs – OpenAccess Series in Informatics 11, 11 p., electronic only (2009).
MSC:  03D32 03D05
PDF BibTeX XML Cite
Full Text: DOI

On oscillation-free \(\varepsilon\)-random sequences. (English) Zbl 1262.03070

Brattka, V. (ed.) et al., Proceedings of the fifth international conference on computability and complexity in analysis (CCA 2008), Hagen, Germany, August 21–24, 2008. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 221, 287-297 (2008).
MSC:  03D32
PDF BibTeX XML Cite
Full Text: DOI

Universal recursively enumerable sets of strings. (English) Zbl 1159.68011

Ito, Masami (ed.) et al., Developments in language theory. 12th international conference, DLT 2008, Kyoto, Japan, September 16–19, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-85779-2/pbk). Lecture Notes in Computer Science 5257, 170-182 (2008).
MSC:  68Q30 03D10 03D25 68Q05 68Q45
PDF BibTeX XML Cite
Full Text: DOI Link

Proceedings of the 6th workshop on computability and complexity in analysis (CCA 2004), Lutherstadt Wittenberg, Germany, August 16–20, 2004. (English) Zbl 1109.03300

Electronic Notes in Theoretical Computer Science 120. Amsterdam: Elsevier. 237 p., electronic only (2005).
PDF BibTeX XML Cite
Full Text: Link

\(\omega \)-P automata with communication rules. (English) Zbl 1202.68192

Martín-Vide, Carlos (ed.) et al., Membrane computing. International workshop, WMC 2003, Tarragona, Spain, July 17–22, 2003. Revised papers. Berlin: Springer (ISBN 3-540-20895-X/pbk). Lect. Notes Comput. Sci. 2933, 203-217 (2004).
MSC:  68Q05 68Q10 68Q45
PDF BibTeX XML Cite
Full Text: DOI

On the Hausdorff measure of \(\omega\)-power languages. (English) Zbl 1117.68412

Calude, Cristian S. (ed.) et al., Developments in language theory. 8th international conference, DLT 2004, Auckland, New Zealand, December 13–17, 2004. Proceedings. Berlin: Springer (ISBN 3-540-24014-4/pbk). Lecture Notes in Computer Science 3340, 393-405 (2004).
MSC:  68Q45 28A78 28A80
PDF BibTeX XML Cite
Full Text: DOI

Finite automata encoding geometric figures. (English) Zbl 1050.68568

Boldt, Oliver (ed.) et al., Automata implementation. 4th international workshop, WIA ’99, Potsdam, Germany, July 17–19, 1999. Revised papers. Berlin: Springer (ISBN 3-540-42812-7). Lect. Notes Comput. Sci. 2214, 101-108 (2001).
MSC:  68P30 68U10 68Q45
PDF BibTeX XML Cite
Full Text: Link

Acceptance of \(\omega\)-languages by communicating deterministic Turing machines. (English) Zbl 1007.68100

Martín-Vide, Carlos (ed.) et al., Where mathematics, computer science, linguistics and biology meet. Essays in honour of Gheorghe Păun. Dordrecht: Kluwer Academic Publishers. 115-125 (2001).
MSC:  68Q45 68Q05
PDF BibTeX XML Cite

How large is the set of disjunctive sequences? (English) Zbl 0982.68085

Calude, C. S. (ed.) et al., Combinatorics, computability and logic. Proceedings of the 3rd international conference, DMTCS ’01. The conference was dedicated to Prof. Frank Harary on the occasion of the 80th birthday. Univ. of Auckland, New Zealand and Univ. of Constanţa, Romania, 2001. London: Springer. Discrete Mathematics and Theoretical Computer Science. 215-225 (2001).
MSC:  68Q45
PDF BibTeX XML Cite

Decidability of code properties. (English) Zbl 1013.68102

Rozenberg, Grzegorz (ed.) et al., Developments in language theory. Foundations, applications, and perspectives. Proceedings of the 4th international conference, Aachen, Germany, July 6-9, 1999. Singapore: World Scientific. 153-163 (2000).
MSC:  68Q45
PDF BibTeX XML Cite

How much can you win when your adversary is handicapped? (English) Zbl 0955.68058

Althöfer, Ingo (ed.) et al., Numbers, information and complexity. Dedicated to Rudolf Ahlswede on the occasion of his 60th birthday. Dordrecht: Kluwer Academic Publishers. 403-412 (2000).
MSC:  68Q30
PDF BibTeX XML Cite

Rich \(\omega\)-words and monadic second-order arithmetic. (English) Zbl 0914.03058

Nielsen, Mogens (ed.) et al., Computer science logic. 11th international workshop, CSL ’97. Annual conference of the EACSL, Aarhus, Denmark, August 23–29, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1414, 478-490 (1998).
PDF BibTeX XML Cite

IFS and control languages. (English) Zbl 0918.68060

Brim, Luboš (ed.) et al., Mathematical foundations of computer science 1998. 23rd international symposium, MFCS ’98. Brno, Czech Republic, August 24–28, 1998. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1450, 740-750 (1998).
PDF BibTeX XML Cite

Finite acceptance of infinite words. (English) Zbl 1096.68663

Dassow, Jürgen (ed.) et al., Developments in language theory. II. At the crossroads of mathematics, computer science and biology. Papers from the conference held in Magdeburg, Germany, July 17–21, 1995. Singapore: World Scientific (ISBN 981-02-2682-9). 360-369 (1996).
MSC:  68Q45
PDF BibTeX XML Cite

Valuations and unambiguity of languages, with applications to fractal geometry. (English) Zbl 1418.68117

Abiteboul, Serge (ed.) et al., Automata, languages and programming. 21st international colloquium, ICALP ’94, Jerusalem, Israel, July 11–14, 1994. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 820, 11-22 (1994).
MSC:  68Q45 28A80 68Q70
PDF BibTeX XML Cite
Full Text: DOI

Hausdorff dimension of constructively specified sets and applications to image processing. (English) Zbl 0759.68092

Topology, measures, and fractals, Proc. 6th Conf. Topology Meas., Warnemünde/Ger. 1991, Math. Res. 66, 109-120 (1992).
MSC:  68U10 28A80 28A78
PDF BibTeX XML Cite

Filter Results by …

Document Type

Reviewing State

all top 5

Year of Publication

all top 3

Classification