×

Found 205 Documents (Results 1–100)

From linear temporal logics to Büchi automata: the early and simple principle. (English) Zbl 1522.68287

Olderog, Ernst-Rüdiger (ed.) et al., Model checking, synthesis, and learning. Essays dedicated to Bengt Jonsson on the occasion of his 60th birthday. Cham: Springer. Lect. Notes Comput. Sci. 13030, 8-40 (2022).
MSC:  68Q45 03B44 03D05
PDFBibTeX XMLCite
Full Text: DOI

Adaptive synchronisation of pushdown automata. (English) Zbl 07730619

Haddad, Serge (ed.) et al., 32nd international conference on concurrency theory, CONCUR 2021, August 24–27, 2021, virtual conference. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 203, Article 17, 15 p. (2021).
MSC:  68Q85
PDFBibTeX XMLCite
Full Text: DOI arXiv

An efficient normalisation procedure for linear temporal logic and very weak alternating automata. (English) Zbl 07299516

Proceedings of the 2020 35th annual ACM/IEEE symposium on logic in computer science, LICS 2020, virtual event, July 8–11, 2020. New York, NY: Association for Computing Machinery (ACM). 831-844 (2020).
MSC:  68-XX 03B44
PDFBibTeX XMLCite
Full Text: DOI arXiv

Alternating weak automata from universal trees. (English) Zbl 07649926

Fokkink, Wan (ed.) et al., 30th international conference on concurrency theory, CONCUR 2019, Amsterdam, the Netherlands, August 27–30, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 140, Article 18, 14 p. (2019).
MSC:  68Q85
PDFBibTeX XMLCite
Full Text: DOI arXiv

On the way to alternating weak automata. (English) Zbl 07561326

Ganguly, Sumit (ed.) et al., 38th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2018, Ahmedabad, India, December 11–13, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 122, Article 21, 22 p. (2018).
MSC:  68Q45
PDFBibTeX XMLCite
Full Text: DOI

Logics meet 1-clock alternating timed automata. (English) Zbl 1520.03001

Schewe, Sven (ed.) et al., 29th international conference on concurrency theory. CONCUR 2018, Beijing, China, September 4–7, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 118, Article 39, 17 p. (2018).
MSC:  03B44 03D05
PDFBibTeX XMLCite
Full Text: DOI

The state complexity of alternating automata. (English) Zbl 1497.68262

Proceedings of the 2018 33rd annual ACM/IEEE symposium on logic in computer science, LICS 2018, Oxford, UK, July 9–12, 2018. New York, NY: Association for Computing Machinery (ACM). 414-421 (2018).
MSC:  68Q45 11A41
PDFBibTeX XMLCite
Full Text: DOI

Extending temporal logics with data variable quantifications. (English) Zbl 1360.68600

Raman, Venkatesh (ed.) et al., 34th international conference on foundation of software technology and theoretical computer science, FSTTCS 2014, New Delhi, India, December 15–17, 2014. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-77-4). LIPIcs – Leibniz International Proceedings in Informatics 29, 253-265 (2014).
MSC:  68Q60 03B25 03B44
PDFBibTeX XMLCite
Full Text: DOI

How random are word maps? (English) Zbl 1341.20030

Breuillard, Emmanuel (ed.) et al., Thin groups and superstrong approximation. Selected papers based on the presentations at the workshop held at MSRI, Berkeley, CA, USA, February 6–10, 2012. Cambridge: Cambridge University Press (ISBN 978-1-107-03685-7/hbk). Mathematical Sciences Research Institute Publications 61, 141-149 (2014).
PDFBibTeX XMLCite

Rabin-Mostowski index problem: a step beyond deterministic automata. (English) Zbl 1366.68142

Proceedings of the 2013 28th annual ACM/IEEE symposium on logic in computer science, LICS 2013, Tulane University, New Orleans, LA, USA, June 25–28, 2013. Los Alamitos, CA: IEEE Computer Society (ISBN 978-0-7695-5020-6). 499-508 (2013).
MSC:  68Q45 03B25 03D05
PDFBibTeX XMLCite
Full Text: DOI

A characterization theorem for the alternation-free fragment of the modal \(\mu\)-calculus. (English) Zbl 1366.03186

Proceedings of the 2013 28th annual ACM/IEEE symposium on logic in computer science, LICS 2013, Tulane University, New Orleans, LA, USA, June 25–28, 2013. Los Alamitos, CA: IEEE Computer Society (ISBN 978-0-7695-5020-6). 478-487 (2013).
PDFBibTeX XMLCite
Full Text: DOI

Solving partial-information stochastic parity games. (English) Zbl 1369.91016

Proceedings of the 2013 28th annual ACM/IEEE symposium on logic in computer science, LICS 2013, Tulane University, New Orleans, LA, USA, June 25–28, 2013. Los Alamitos, CA: IEEE Computer Society (ISBN 978-0-7695-5020-6). 341-348 (2013).
MSC:  91A15 68Q45 91A05
PDFBibTeX XMLCite
Full Text: DOI

Emptiness of alternating tree automata using games with imperfect information. (English) Zbl 1359.68166

Seth, Anil (ed.) et al., 33nd international conference on foundations of software technology and theoretical computer science, FSTTCS 2013, Guwahati, India, December 12–14, 2013. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-64-4). LIPIcs – Leibniz International Proceedings in Informatics 24, 299-311 (2013).
MSC:  68Q45 91A43 91A80
PDFBibTeX XMLCite
Full Text: DOI

On the separation question for tree languages. (English) Zbl 1245.68116

Dürr, Christoph (ed.) et al., STACS 2012. 29th international symposium on theoretical aspects of computer science, Paris, France, February 29th – March 3rd, 2012. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-35-4). LIPIcs – Leibniz International Proceedings in Informatics 14, 396-407, electronic only (2012).
MSC:  68Q45 03D05
PDFBibTeX XMLCite
Full Text: DOI

On topological completeness of regular tree languages. (English) Zbl 1354.03052

Constable, Robert L. (ed.) et al., Logic and program semantics. Essays dedicated to Dexter Kozen on the occasion of his 60th birthday. Berlin: Springer (ISBN 978-3-642-29484-6/pbk). Lecture Notes in Computer Science 7230, 165-179 (2012).
MSC:  03D05 03E15
PDFBibTeX XMLCite
Full Text: DOI

Definable operations on weakly recognizable sets of trees. (English) Zbl 1246.68142

Chakraborthy, Supraik (ed.) et al., IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2011), Mumbai, India, December 12–14, 2011. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-34-7). LIPIcs – Leibniz International Proceedings in Informatics 13, 363-374, electronic only (2011).
MSC:  68Q45
PDFBibTeX XMLCite
Full Text: DOI

On the complexity of Szilard languages of regulated grammars. (English) Zbl 1351.68098

Cerone, Antonio (ed.) et al., Theoretical aspects of computing – ICTAC 2011. 8th international colloquium, Johannesburg, South Africa, August 31 – September 2, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-23282-4/pbk). Lecture Notes in Computer Science 6916, 77-94 (2011).
MSC:  68Q05 68Q15 68Q25 68Q42 68Q45
PDFBibTeX XMLCite
Full Text: DOI

On process-algebraic extensions of metric temporal logic. (English) Zbl 1215.68150

Jones, Cliff B. (ed.) et al., Reflections on the work of C. A. R. Hoare. Most papers based on the presentations at the meeting to celebrate Tony Hoare’s 75th birthday, Cambridge, UK, April 2009. London: Springer (ISBN 978-1-84882-911-4/hbk; 978-1-84882-912-1/ebook). 283-300 (2010).
MSC:  68Q85 03B44 03B70
PDFBibTeX XMLCite
Full Text: DOI

Finite groups have short rewriting systems. (English) Zbl 1214.20036

Kappe, Luise-Charlotte (ed.) et al., Computational group theory and the theory of groups. II. Papers of the conference on computational group theory and cohomology, Harlaxton College, Grantham, UK, August 4–8, 2008 and the AMS special session on computational group theory, Western Michigan University, Kalamazoo, MI, USA, October 17–19, 2008. Providence, RI: American Mathematical Society (AMS) (ISBN 978-0-8218-4805-0/pbk). Contemporary Mathematics 511, 185-200 (2010).
PDFBibTeX XMLCite

Mediating for reduction (on minimizing alternating Büchi automata). (English) Zbl 1248.68280

Kannan, Ravi (ed.) et al., IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2009), December 15–17, 2009, Kanpur, India. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-13-2). LIPIcs – Leibniz International Proceedings in Informatics 4, 1-12, electronic only (2009).
MSC:  68Q45
PDFBibTeX XMLCite
Full Text: DOI Link

On the complexity of branching-time logics. (English) Zbl 1257.03043

Grädel, Erich (ed.) et al., Computer science logic. 23rd international workshop, CSL 2009, 18th annual conference of the EACSL, Coimbra, Portugal, September 7–11, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-04026-9/pbk). Lecture Notes in Computer Science 5771, 530-545 (2009).
PDFBibTeX XMLCite
Full Text: DOI

First-order definable languages. (English) Zbl 1234.03024

Flum, Jörg (ed.) et al., Logic and automata. History and perspectives. Dedicated to Wolfgang Thomas on the occasion of his sixtieth birthday. Amsterdam: Amsterdam University Press (ISBN 978-90-5356-576-6/pbk). Texts in Logic and Games 2, 261-306 (2008).
MSC:  03D05 68Q17 68Q45
PDFBibTeX XMLCite

Combining equational tree automata over AC and ACI theories. (English) Zbl 1155.68038

Voronkov, Andrei (ed.), Rewriting techniques and applications. 19th international conference, RTA 2008, Hagenberg, Austria, July 15–17, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-70588-8/pbk). Lecture Notes in Computer Science 5117, 142-156 (2008).
PDFBibTeX XMLCite
Full Text: DOI Link

Describing the Wadge hierarchy for the alternation free fragment of \(\mu \)-calculus. I. The levels below \(\omega _{1}\). (English) Zbl 1142.03338

Beckmann, Arnold (ed.) et al., Logic and theory of algorithms. 4th conference on computability in Europe, CiE 2008, Athens, Greece, June 15–20, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-69405-2/pbk). Lecture Notes in Computer Science 5028, 186-195 (2008).
MSC:  03B45 03D05 03E15
PDFBibTeX XMLCite
Full Text: DOI

Bounded model checking for weak alternating Büchi automata. (English) Zbl 1188.68189

Ball, Thomas (ed.) et al., Computer aided verification. 18th international conference, CAV 2006, Seattle, WA, USA, August 17–20, 2006. Proceedings. Berlin: Springer (ISBN 3-540-37406-X/pbk). Lecture Notes in Computer Science 4144, 95-108 (2006).
MSC:  68Q60 68Q45
PDFBibTeX XMLCite
Full Text: DOI

Finite automata. (English) Zbl 1087.68577

Martín-Vide, Carlos (ed.) et al., Formal languages and applications. Berlin: Springer (ISBN 3-540-20907-7/hbk). Studies in Fuzziness and Soft Computing 148, 55-85 (2004).
MSC:  68Q45
PDFBibTeX XMLCite

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