Chatterjee, Kingshuk; Ray, Kumar Sankar Unary Watson-Crick automata. (English) Zbl 1423.68247 Theor. Comput. Sci. 782, 107-112 (2019). MSC: 68Q45 PDF BibTeX XML Cite \textit{K. Chatterjee} and \textit{K. S. Ray}, Theor. Comput. Sci. 782, 107--112 (2019; Zbl 1423.68247) Full Text: DOI
Chatterjee, Kingshuk; Ray, Kumar Sankar Non-regular unary language and parallel communicating Watson-Crick automata systems. (English) Zbl 1380.68251 Theor. Comput. Sci. 705, 113-117 (2018). MSC: 68Q45 68Q10 PDF BibTeX XML Cite \textit{K. Chatterjee} and \textit{K. S. Ray}, Theor. Comput. Sci. 705, 113--117 (2018; Zbl 1380.68251) Full Text: DOI
Shur, Arseny M.; Yakaryılmaz, Abuzer More on quantum, stochastic, and pseudo stochastic languages with few states. (English) Zbl 1415.68139 Nat. Comput. 15, No. 1, 129-141 (2016). MSC: 68Q45 68Q05 PDF BibTeX XML Cite \textit{A. M. Shur} and \textit{A. Yakaryılmaz}, Nat. Comput. 15, No. 1, 129--141 (2016; Zbl 1415.68139) Full Text: DOI
Palioudakis, Alexandros; Salomaa, Kai; Akl, Selim G. Operational state complexity of unary NFAs with finite nondeterminism. (English) Zbl 1332.68125 Theor. Comput. Sci. 610, Part A, 108-120 (2016). MSC: 68Q45 PDF BibTeX XML Cite \textit{A. Palioudakis} et al., Theor. Comput. Sci. 610, Part A, 108--120 (2016; Zbl 1332.68125) Full Text: DOI
Palioudakis, Alexandros; Salomaa, Kai; Akl, Selim G. Unary NFAs with limited nondeterminism. (English) Zbl 1432.68242 Geffert, Viliam (ed.) et al., SOFSEM 2014: theory and practice of computer science. 40th international conference on current trends in theory and practice of computer science, Nový Smokovec, Slovakia, January 26–29, 2014. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8327, 443-454 (2014). MSC: 68Q45 PDF BibTeX XML Cite \textit{A. Palioudakis} et al., Lect. Notes Comput. Sci. 8327, 443--454 (2014; Zbl 1432.68242) Full Text: DOI
Cain, Alan J.; Ruškuc, Nik Subalgebras of FA-presentable algebras. (English) Zbl 1321.08001 Algebra Univers. 72, No. 2, 101-123 (2014). MSC: 08A30 03D05 03D45 08A70 68Q45 PDF BibTeX XML Cite \textit{A. J. Cain} and \textit{N. Ruškuc}, Algebra Univers. 72, No. 2, 101--123 (2014; Zbl 1321.08001) Full Text: DOI arXiv
Palioudakis, Alexandros; Salomaa, Kai; Akl, Selim G. State complexity of unary language operations for NFAs with limited nondeterminism. (English) Zbl 1332.68124 Jürgensen, Helmut (ed.) et al., Descriptional complexity of formal systems. 16th international workshop, DCFS 2014, Turku, Finland, August 5–8, 2014. Proceedings. Berlin: Springer (ISBN 978-3-319-09703-9/pbk). Lecture Notes in Computer Science 8614, 330-341 (2014). MSC: 68Q45 PDF BibTeX XML Cite \textit{A. Palioudakis} et al., Lect. Notes Comput. Sci. 8614, 330--341 (2014; Zbl 1332.68124) Full Text: DOI
Kunc, Michal; Okhotin, Alexander State complexity of operations on two-way finite automata over a unary alphabet. (English) Zbl 1255.68078 Theor. Comput. Sci. 449, 106-118 (2012). MSC: 68Q19 68Q45 PDF BibTeX XML Cite \textit{M. Kunc} and \textit{A. Okhotin}, Theor. Comput. Sci. 449, 106--118 (2012; Zbl 1255.68078) Full Text: DOI
Geffert, Viliam; Pighizzini, Giovanni Pairs of complementary unary languages with “balanced” nondeterministic automata. (English) Zbl 1236.68168 Algorithmica 63, No. 3, 571-587 (2012). MSC: 68Q45 PDF BibTeX XML Cite \textit{V. Geffert} and \textit{G. Pighizzini}, Algorithmica 63, No. 3, 571--587 (2012; Zbl 1236.68168) Full Text: DOI
Karhumäki, Juhani; Saarela, Aleksi The unique decipherability in the monoid of regular languages is undecidable. (English) Zbl 1234.68215 Fundam. Inform. 110, No. 1-4, 197-200 (2011). MSC: 68Q45 20M35 PDF BibTeX XML Cite \textit{J. Karhumäki} and \textit{A. Saarela}, Fundam. Inform. 110, No. 1--4, 197--200 (2011; Zbl 1234.68215) Full Text: DOI
Geffert, Viliam; Pighizzini, Giovanni Two-way unary automata versus logarithmic space. (English) Zbl 1216.68143 Inf. Comput. 209, No. 7, 1016-1025 (2011). MSC: 68Q45 68Q15 PDF BibTeX XML Cite \textit{V. Geffert} and \textit{G. Pighizzini}, Inf. Comput. 209, No. 7, 1016--1025 (2011; Zbl 1216.68143) Full Text: DOI
Geffert, Viliam; Pighizzini, Giovanni Two-way unary automata versus logarithmic space. (English) Zbl 1250.68157 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, 197-208 (2010). MSC: 68Q45 68Q15 PDF BibTeX XML Cite \textit{V. Geffert} and \textit{G. Pighizzini}, Lect. Notes Comput. Sci. 6224, 197--208 (2010; Zbl 1250.68157) Full Text: DOI
Geffert, Viliam; Pighizzini, Giovanni Pairs of complementary unary languages with “balanced” nondeterministic automata. (English) Zbl 1283.68195 López-Ortiz, Alejandro (ed.), LATIN 2010: Theoretical informatics. 9th Latin American symposium, Oaxaca, Mexico, April 19–23, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-12199-9/pbk). Lecture Notes in Computer Science 6034, 196-207 (2010). MSC: 68Q45 PDF BibTeX XML Cite \textit{V. Geffert} and \textit{G. Pighizzini}, Lect. Notes Comput. Sci. 6034, 196--207 (2010; Zbl 1283.68195) Full Text: DOI
Dassow, Jürgen; Martín, Gema M.; Vico, Francisco J. A similarity measure for cyclic unary regular languages. (English) Zbl 1200.68137 Fundam. Inform. 96, No. 1-2, 71-88 (2009). MSC: 68Q45 PDF BibTeX XML Cite \textit{J. Dassow} et al., Fundam. Inform. 96, No. 1--2, 71--88 (2009; Zbl 1200.68137) Full Text: DOI
Jeż, Artur Conjunctive grammars can generate non-regular unary languages. (English) Zbl 1202.68216 Harju, Tero (ed.) et al., Developments in language theory. 11th international conference, DLT 2007, Turku, Finland, July 3–6, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73207-5/pbk). Lecture Notes in Computer Science 4588, 242-253 (2007). MSC: 68Q42 68Q45 PDF BibTeX XML Cite \textit{A. Jeż}, Lect. Notes Comput. Sci. 4588, 242--253 (2007; Zbl 1202.68216) Full Text: DOI
Petković, T.; Ćirić, M.; Bogdanović, S. On correspondences between unary algebras, automata, semigroups and congruences. (English) Zbl 1103.08003 Algebra Colloq. 13, No. 3, 495-506 (2006). Reviewer: Saeed Salehí (Zanjan) MSC: 08A60 08A30 08B99 20M07 68Q70 PDF BibTeX XML Cite \textit{T. Petković} et al., Algebra Colloq. 13, No. 3, 495--506 (2006; Zbl 1103.08003) Full Text: DOI
Domaratzki, Michael; Salomaa, Kai Restricted sets of trajectories and decidability of shuffle decompositions. (English) Zbl 1080.68053 Int. J. Found. Comput. Sci. 16, No. 5, 897-912 (2005). MSC: 68Q45 PDF BibTeX XML Cite \textit{M. Domaratzki} and \textit{K. Salomaa}, Int. J. Found. Comput. Sci. 16, No. 5, 897--912 (2005; Zbl 1080.68053) Full Text: DOI
Domaratzki, Michael; Ellul, Keith; Shallit, Jeffrey; Wang, Ming-Wei Non-uniqueness and radius of cyclic unary NFAs. (English) Zbl 1080.68052 Int. J. Found. Comput. Sci. 16, No. 5, 883-896 (2005). MSC: 68Q45 PDF BibTeX XML Cite \textit{M. Domaratzki} et al., Int. J. Found. Comput. Sci. 16, No. 5, 883--896 (2005; Zbl 1080.68052) Full Text: DOI
Shallit, Jeffrey Formal languages and number theory. (English) Zbl 1089.68060 Nathanson, Melvyn B. (ed.), Unusual applications of number theory. Proceedings of the DIMACS workshop held at Rutgers University, Piscataway, NJ, USA, January 10–14, 2000. Providence, RI: American Mathematical Society (AMS) (ISBN 0-8218-2703-0/hbk). DIMACS. Series in Discrete Mathematics and Theoretical Computer Science 64, 169-181 (2004). MSC: 68Q45 68R15 11B85 PDF BibTeX XML Cite \textit{J. Shallit}, DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 64, 169--181 (2004; Zbl 1089.68060)
Wätjen, Dietmar On unary k-limited 0L systems and languages. (English) Zbl 0661.68071 J. Inf. Process. Cybern. 24, No. 9, 415-429 (1988). Reviewer: M.Gheorghe MSC: 68Q45 68Q42 PDF BibTeX XML Cite \textit{D. Wätjen}, J. Inf. Process. Cybern. 24, No. 9, 415--429 (1988; Zbl 0661.68071)
Li, Lian The algebraic structures of semilinear Abelian languages. (Chinese) Zbl 0795.68114 Chin. Ann. Math., Ser. A 9, No. 5, 623-629 (1988). MSC: 68Q45 68Q70 PDF BibTeX XML Cite \textit{L. Li}, Chin. Ann. Math., Ser. A 9, No. 5, 623--629 (1988; Zbl 0795.68114)