×

Found 110 Documents (Results 1–100)

The dot-depth hierarchy, 45 years later. (English) Zbl 1404.68073

Konstantinidis, Stavros (ed.) et al., The role of theory in computer science. Essays dedicated to Janusz Brzozowski. Hackensack, NJ: World Scientific (ISBN 978-981-3148-19-2/hbk; 978-981-3148-21-5/ebook). 177-201 (2017).
MSC:  68Q45 68Q70
PDFBibTeX XMLCite
Full Text: DOI HAL

Syntactic monoids in a category. (English) Zbl 1366.68188

Moss, Lawrence S. (ed.) et al., 6th conference on algebra and coalgebra in computer science, CALCO’15, Nijmegen, Netherlands, June 24–26, 2015. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-84-2). LIPIcs – Leibniz International Proceedings in Informatics 35, 1-16 (2015).
MSC:  68Q70 18D15 20M35
PDFBibTeX XMLCite
Full Text: DOI arXiv

Syntactic complexity of \({\mathcal R}\)- and \({\mathcal J}\)-trivial regular languages. (English) Zbl 1304.68095

Jürgensen, Helmut (ed.) et al., Descriptional complexity of formal systems. 15th international workshop, DCFS 2013, London, ON, Canada, July 22–25, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-39309-9/pbk). Lecture Notes in Computer Science 8031, 160-171 (2013).
MSC:  68Q45
PDFBibTeX XMLCite
Full Text: DOI arXiv

Generalized disjunctive languages and universal algebra. (English) Zbl 1372.68182

Bai, Chengming (ed.) et al., Operads and universal algebra. Proceedings of the summer school and international conference, Tianjin, China, July 5–9, 2010. Hackensack, NJ: World Scientific (ISBN 978-981-4365-11-6/hbk; 978-981-4458-33-7/ebook). Nankai Series in Pure, Applied Mathematics and Theoretical Physics 9, 89-106 (2012).
MSC:  68Q70
PDFBibTeX XMLCite
Full Text: DOI

Syntactic complexity of prefix-, suffix-, and bifix-free regular languages. (English) Zbl 1341.68080

Holzer, Markus (ed.) et al., Descriptional complexity of formal systems. 13th international workshop, DCFS 2011, Gießen/Limburg, Germany, July 25–27, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22599-4/pbk). Lecture Notes in Computer Science 6808, 93-106 (2011).
MSC:  68Q45 20M35
PDFBibTeX XMLCite
Full Text: DOI

Syntactic complexity of ideal and closed languages. (English) Zbl 1221.68118

Mauri, Giancarlo (ed.) et al., Developments in language theory. 15th international conference, DLT 2011, Milan, Italy, July 19–22, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22320-4/pbk). Lecture Notes in Computer Science 6795, 117-128 (2011).
MSC:  68Q45
PDFBibTeX XMLCite
Full Text: DOI arXiv

Hierarchies of piecewise testable languages. (English) Zbl 1159.68023

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, 479-490 (2008).
MSC:  68Q70
PDFBibTeX XMLCite
Full Text: DOI

Deletion on trajectories and commutative closure. (English) Zbl 1040.68053

Harju, Tero (ed.) et al., Proceedings of WORDS’03, the 4th international conference on combinatorics on words, Turku, Finland, September 10–13, 2003. Turku: Turku Centre for Computer Science (ISBN 952-12-1211-X/pbk). TUCS General Publication 27, 309-319 (2003).
MSC:  68Q45
PDFBibTeX XMLCite

On deterministic finite automata and syntactic monoid size, continued. (English) Zbl 1037.68098

Ésik, Zoltán (ed.) et al., Developments in language theory. 7th international conference, DLT 2003, Szeged, Hungary, July 7–11, 2003. Proceedings. Berlin: Springer (ISBN 3-540-40434-1/pbk). Lect. Notes Comput. Sci. 2710, 349-360 (2003).
MSC:  68Q70 20M35
PDFBibTeX XMLCite
Full Text: Link

Finite models, automata, and circuit complexity. (English) Zbl 0880.68092

Immerman, Neil (ed.) et al., Descriptive complexity and finite models. Proceedings of a DIMACS workshop, January 14–17, 1996, Princeton Univ., Princeton, NJ, USA. Providence, RI: AMS, American Mathematical Society. DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 31, 63-96 (1997).
MSC:  68Q45
PDFBibTeX XMLCite

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software