×

Found 75 Documents (Results 1–75)

Newest Citations Relevance
Clemente, Lorenzo; Lasota, Sławomir; Piórkowski, Radosław

Determinisability of one-clock timed automata. (English) Zbl 07559498

Konnov, Igor (ed.) et al., 31st international conference on concurrency theory. CONCUR 2020, September 1–4, 2020, Vienna, Austria, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 171, Article 42, 17 p. (2020).
MSC:  68Q85
Cite Review PDF
Full Text: DOI arXiv
Cho, Da-Jung; Han, Yo-Sub; Salomaa, Kai; Smith, Taylor J.

Site-directed insertion: decision problems, maximality and minimality. (English) Zbl 1435.68152

Konstantinidis, Stavros (ed.) et al., Descriptional complexity of formal systems. 20th IFIP WG 1.02 international conference, DCFS 2018, Halifax, NS, Canada, July 25–27, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10952, 49-61 (2018).
MSC:  68Q45
Cite Review PDF
Full Text: DOI arXiv
Ko, Sang-Ki; Potapov, Igor

Matrix semigroup freeness problems in \(\mathrm{SL}(2,\mathbb {Z})\). (English) Zbl 1444.20034

Steffen, Bernhard (ed.) et al., SOFSEM 2017: theory and practice of computer science. 43rd international conference on current trends in theory and practice of computer science, Limerick, Ireland, January 16–20, 2017, Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10139, 268-279 (2017).
MSC:  20M05 68Q17
Cite Review PDF
Full Text: DOI arXiv
Ng, Timothy; Rappaport, David; Salomaa, Kai

State complexity of neighbourhoods and approximate pattern matching. (English) Zbl 1386.68096

Potapov, Igor (ed.), Developments in language theory. 19th international conference, DLT 2015, Liverpool, UK, July 27–30, 2015. Proceedings. Cham: Springer (ISBN 978-3-319-21499-3/pbk; 978-3-319-21500-6/ebook). Lecture Notes in Computer Science 9168, 389-400 (2015).
MSC:  68Q45
Cite Review PDF
Full Text: DOI Link
Palioudakis, Alexandros; Cho, Da-Jung; Goč, Daniel; Han, Yo-Sub; Ko, Sang-Ki; Salomaa, Kai

The state complexity of permutations on finite languages over binary alphabets. (English) Zbl 1432.68241

Shallit, Jeffrey (ed.) et al., Descriptional complexity of formal systems. 17th international workshop, DCFS 2015, Waterloo, ON, Canada, June 25–27, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9118, 220-230 (2015).
MSC:  68Q45
Cite Review PDF
Full Text: DOI
Piao, Xiaoxue; Salomaa, Kai

State complexity of Kleene-star operations on trees. (English) Zbl 1353.68171

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, 388-402 (2012).
MSC:  68Q45
Cite Review PDF
Full Text: DOI

Filter Results by …

Document Type

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software