×

Found 391 Documents (Results 1–100)

Representing regular languages of infinite words using mod 2 multiplicity automata. (English) Zbl 07793020

Bouyer, Patricia (ed.) et al., Foundations of software science and computation structures. 25th international conference, FOSSACS 2022, held as part of the European joint conferences on theory and practice of software, ETAPS 2022, Munich, Germany, April 2–7, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13242, 1-20 (2022).
MSC:  68Nxx 68Qxx
PDFBibTeX XMLCite
Full Text: DOI

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

OmegaThreads: symbolic controller design for \(\omega\)-regular objectives. (English) Zbl 07807706

Proceedings of the 24th ACM international conference on hybrid systems: computation and control, HSCC 2021, part of CPS-IoT week, Nashville, TN, USA, May 19–21, 2021. New York, NY: Association for Computing Machinery (ACM). Paper No. 33, 2 p. (2021).
MSC:  68Q45 68Q60 93C30
PDFBibTeX XMLCite
Full Text: DOI

OmegaThreads: symbolic controller design for \(\omega\)-regular objectives. (English) Zbl 07807698

Proceedings of the 24th ACM international conference on hybrid systems: computation and control, HSCC 2021, part of CPS-IoT week, Nashville, TN, USA, May 19–21, 2021. New York, NY: Association for Computing Machinery (ACM). Paper No. 25, 7 p. (2021).
MSC:  68Q45 68Q60 93C30
PDFBibTeX XMLCite
Full Text: DOI

\(\omega \)-automata. (English) Zbl 1516.68051

Pin, Jean-Éric (ed.), Handbook of automata theory. Volume I. Theoretical foundations. Berlin: European Mathematical Society (EMS). 189-234 (2021).
MSC:  68Q45 03D05
PDFBibTeX XMLCite
Full Text: DOI

Strongly unambiguous Büchi automata are polynomially predictable with membership queries. (English) Zbl 07650821

Fernández, Maribel (ed.) et al., 28th EACSL annual conference on computer science logic, CSL 2020, Barcelona, Spain, January 13–16, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 152, Article 8, 17 p. (2020).
MSC:  68-XX 03B70
PDFBibTeX XMLCite
Full Text: DOI

Polynomial identification of \(\omega \)-automata. (English) Zbl 1483.68153

Biere, Armin (ed.) et al., Tools and algorithms for the construction and analysis of systems. 26th international conference, TACAS 2020, held as part of the European joint conferences on theory and practice of software, ETAPS 2020, Dublin, Ireland, April 25–30, 2020. Proceedings. Part II. Cham: Springer. Lect. Notes Comput. Sci. 12079, 325-343 (2020).
MSC:  68Q45 68Q32
PDFBibTeX XMLCite
Full Text: DOI

Extensions of \(\omega \)-regular languages. (English) Zbl 1498.03022

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). 266-272 (2020).
MSC:  03B16 03B25 68Q45
PDFBibTeX XMLCite
Full Text: DOI arXiv

The automatic Baire property and an effective property of \(\omega\)-rational functions. (English) Zbl 1484.03075

Leporati, Alberto (ed.) et al., Language and automata theory and applications. 14th international conference, LATA 2020, Milan, Italy, March 4–6, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12038, 303-314 (2020).
MSC:  03D05 03D45 03E15
PDFBibTeX XMLCite
Full Text: DOI arXiv

Greibach normal form for \(\omega\)-algebraic systems and weighted simple \(\omega\)-pushdown automata. (English) Zbl 1504.68098

Chattopadhyay, Arkadev (ed.) et al., 39th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2019, Bombay, India, December 11–13, 2019. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 150, Article 38, 14 p. (2019).
MSC:  68Q45 68Q42 68Q70
PDFBibTeX XMLCite
Full Text: DOI

\(\Omega\)-automata: a coalgebraic perspective on regular \(\omega\)-languages. (English) Zbl 07649888

Roggenbach, Markus (ed.) et al., 8th conference on algebra and coalgebra in computer science, CALCO 2019, London, United Kingdom, June 3–6, 2019. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 139, Article 5, 18 p. (2019).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI

A coalgebraic take on regular and \(\omega\)-regular behaviour for systems with internal moves. (English) Zbl 1520.68054

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 25, 18 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI

Why these automata types? (English) Zbl 1415.68122

Barthe, Gilles (ed.) et al., LPAR-22. 22nd international conference on logic for programming, artificial intelligence and reasoning, Awassa, Ethiopia, November 17–21, 2018. Selected papers. Manchester: EasyChair. EPiC Ser. Comput. 57, 143-163 (2018).
MSC:  68Q45
PDFBibTeX XMLCite
Full Text: DOI

Polishness of some topologies related to automata. (English) Zbl 1434.03100

Goranko, Valentin (ed.) et al., 26th EACSL annual conference on computer science logic, CSL 2017, Stockholm, Sweden, August 20–24, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 82, Article 22, 16 p. (2017).
PDFBibTeX XMLCite
Full Text: DOI

On the (in)succinctness of Muller automata. (English) Zbl 1434.68235

Goranko, Valentin (ed.) et al., 26th EACSL annual conference on computer science logic, CSL 2017, Stockholm, Sweden, August 20–24, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 82, Article 12, 16 p. (2017).
MSC:  68Q45
PDFBibTeX XMLCite
Full Text: DOI

Decision problems for subclasses of rational relations over finite and infinite words. (English) Zbl 1416.68105

Klasing, Ralf (ed.) et al., Fundamentals of computation theory. 21st international symposium, FCT 2017, Bordeaux, France, September 11–13, 2017. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 10472, 341-354 (2017).
MSC:  68Q45 68Q25
PDFBibTeX XMLCite
Full Text: DOI arXiv

Expressive power of evolving neural networks working on infinite input streams. (English) Zbl 1495.68058

Klasing, Ralf (ed.) et al., Fundamentals of computation theory. 21st international symposium, FCT 2017, Bordeaux, France, September 11–13, 2017. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 10472, 150-163 (2017).
PDFBibTeX XMLCite
Full Text: DOI HAL

Robust model checking of timed automata under clock drifts. (English) Zbl 1366.68152

Proceedings of the 20th ACM international conference on hybrid systems: computation and control, HSCC 2017, Pittsburgh, PA, USA, April 18–20, 2017. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4590-3). 153-162 (2017).
MSC:  68Q45 68Q60
PDFBibTeX XMLCite
Full Text: DOI

Families of DFAs as acceptors of \(\omega\)-regular languages. (English) Zbl 1398.68292

Faliszewski, Piotr (ed.) et al., 41st international symposium on mathematical foundations of computer science, MFCS 2016, Kraków, Poland, August 22–26, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-016-3). LIPIcs – Leibniz International Proceedings in Informatics 58, Article 11, 14 p. (2016).
MSC:  68Q45 68Q25
PDFBibTeX XMLCite
Full Text: DOI

The complexity of rational synthesis. (English) Zbl 1388.68163

Chatzigiannakis, Ioannis (ed.) et al., 43rd international colloquium on automata, languages, and programming, ICALP 2016, Rome, Italy, July 12–15, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-013-2). LIPIcs – Leibniz International Proceedings in Informatics 55, Article 121, 15 p. (2016).
MSC:  68Q45 68Q25 91A80
PDFBibTeX XMLCite
Full Text: DOI

Descriptive set theoretic methods in automata theory. Decidability and topological complexity. (English) Zbl 1375.03003

Lecture Notes in Computer Science 9802. Berlin: Springer (ISBN 978-3-662-52946-1/pbk; 978-3-662-52947-8/ebook). xiii, 211 p. (2016).
PDFBibTeX XMLCite
Full Text: DOI

On relative and probabilistic finite counterability. (English) Zbl 1373.68288

Kreutzer, Stephan (ed.), 24th EACSL annual conference and 29th workshop on computer science logic, CSL’15, Berlin, Germany, September 7–10, 2015. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-90-3). LIPIcs – Leibniz International Proceedings in Informatics 41, 175-192 (2015).
MSC:  68Q60 68Q45
PDFBibTeX XMLCite
Full Text: DOI

The sensing cost of monitoring and synthesis. (English) Zbl 1366.68131

Harsha, Prahladh (ed.) et al., 35th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2015, Bangalore, India, December 16–18, 2015. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-97-2). LIPIcs – Leibniz International Proceedings in Informatics 45, 380-393 (2015).
MSC:  68Q45 68Q17 68Q60
PDFBibTeX XMLCite
Full Text: DOI

Efficient algorithms for morphisms over omega-regular languages. (English) Zbl 1366.68192

Harsha, Prahladh (ed.) et al., 35th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2015, Bangalore, India, December 16–18, 2015. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-97-2). LIPIcs – Leibniz International Proceedings in Informatics 45, 112-124 (2015).
MSC:  68Q70 03D05 20M35
PDFBibTeX XMLCite
Full Text: DOI arXiv

From \(\omega\)-regular expressions to Büchi automata via partial derivatives. (English) Zbl 1451.68162

Dediu, Adrian-Horia (ed.) et al., Language and automata theory and applications. 9th international conference, LATA 2015, Nice, France, March 2–6, 2015. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8977, 287-298 (2015).
MSC:  68Q45
PDFBibTeX XMLCite
Full Text: DOI

Regular sensing. (English) Zbl 1360.68537

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, 161-173 (2014).
MSC:  68Q45
PDFBibTeX XMLCite
Full Text: DOI

\(\omega \)-rational languages: high complexity classes vs. Borel hierarchy. (English) Zbl 1407.68253

Dediu, Adrian-Horia (ed.) et al., Language and automata theory and applications. 8th international conference, LATA 2014, Madrid, Spain, March 10–14, 2014. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8370, 372-383 (2014).
MSC:  68Q45 03E15
PDFBibTeX XMLCite
Full Text: DOI HAL

From monadic second-order definable string transformations to transducers. (English) Zbl 1366.68133

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). 458-467 (2013).
MSC:  68Q45 03B25 03D05
PDFBibTeX XMLCite
Full Text: DOI

Adding an equivalence relation to the interval logic \(AB\bar{B}\): complexity and expressiveness. (English) Zbl 1366.03185

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). 193-202 (2013).
PDFBibTeX XMLCite
Full Text: DOI

What is decidable about partially observable Markov decision processes with omega-regular objectives. (English) Zbl 1356.68142

Ronchi della Rocca, Simona (ed.), Computer science logic 2013. Selected papers of the 27th CSL workshop and 22nd annual conference of the European Association for Computer Science Logic (EACSL), Torino, Italy, September 2–5, 2013. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-60-6). LIPIcs – Leibniz International Proceedings in Informatics 23, 165-180 (2013).
PDFBibTeX XMLCite
Full Text: DOI

Operator precedence \(\omega \)-languages. (English) Zbl 1381.68130

Béal, Marie-Pierre (ed.) et al., Developments in language theory. 17th international conference, DLT 2013, Marne-la-Vallée, France, June 18–21, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-38770-8/pbk). Lecture Notes in Computer Science 7907, 396-408 (2013).
MSC:  68Q45 68Q60
PDFBibTeX XMLCite
Full Text: DOI arXiv

Boolean algebras of regular \(\omega \)-languages. (English) Zbl 1377.68120

Dediu, Adrian-Horia (ed.) et al., Language and automata theory and applications. 7th international conference, LATA 2013, Bilbao, Spain, April 2–5, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-37063-2/pbk). Lecture Notes in Computer Science 7810, 504-515 (2013).
MSC:  68Q45 68Q70
PDFBibTeX XMLCite
Full Text: DOI

Regular transformations of infinite strings. (English) Zbl 1360.68538

Proceedings of the 2012 27th annual ACM/IEEE symposium on logic in computer science, LICS 2012, Dubrovnik, Croatia, June 25–28, 2012. Los Alamitos, CA: IEEE Computer Society (ISBN 978-0-7695-4769-5). 65-74 (2012).
MSC:  68Q45 03D05
PDFBibTeX XMLCite
Full Text: DOI

Deterministic fuzzy automata on fuzzy regular \(\omega\)-languages. (English) Zbl 1293.68180

Arumugam, S. (ed.) et al., Combinatorial algorithms. 23rd international workshop, IWOCA 2012, Tamil Nadu, India, July 19–21, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-35925-5/pbk). Lecture Notes in Computer Science 7643, 182-188 (2012).
MSC:  68Q45
PDFBibTeX XMLCite
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