×

Found 972 Documents (Results 1–100)

State complexity of finite partial languages. (English) Zbl 07643471

Han, Yo-Sub (ed.) et al., Descriptional complexity of formal systems. 24th IFIP WG 1.02 international conference, DCFS 2022, Debrecen, Hungary, August 29–31, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13439, 170-183 (2022).
MSC:  68Qxx
PDF BibTeX XML Cite
Full Text: DOI

Deciding top-down determinism of regular tree languages. (English) Zbl 07530244

Bampis, Evripidis (ed.) et al., Fundamentals of computation theory. 23rd international symposium, FCT 2021, Athens, Greece, September 12–15, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12867, 341-353 (2021).
MSC:  68Qxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

Obfuscating finite automata. (English) Zbl 1485.94087

Dunkelman, Orr (ed.) et al., Selected areas in cryptography. 27th international conference, Halifax, NS, Canada (virtual event), October 21–23, 2020. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12804, 90-114 (2021).
MSC:  94A60 68Q32
PDF BibTeX XML Cite
Full Text: DOI

Nondeterministic and co-nondeterministic implies deterministic, for data languages. (English) Zbl 07410434

Kiefer, Stefan (ed.) et al., Foundations of software science and computation structures. 24th international conference, FOSSACS 2021, held as part of the European joint conferences on theory and practice of software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 – April 1, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12650, 365-384 (2021).
MSC:  68Nxx 68Qxx
PDF BibTeX XML Cite
Full Text: DOI

Usefulness of information and unary languages. (English) Zbl 07405983

Leporati, Alberto (ed.) et al., Language and automata theory and applications. 15th international conference, LATA 2021, Milan, Italy, March 1–5, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12638, 131-142 (2021).
MSC:  68Q45
PDF BibTeX XML Cite
Full Text: DOI

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
PDF BibTeX XML Cite
Full Text: DOI arXiv

Unary prime languages. (English) Zbl 07559422

Esparza, Javier (ed.) et al., 45th international symposium on mathematical foundations of computer science, MFCS 2020, August 25–26, 2020, Prague, Czech Republic. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 170, Article 51, 12 p. (2020).
MSC:  68Qxx
PDF BibTeX XML Cite
Full Text: DOI

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
PDF BibTeX XML Cite
Full Text: DOI arXiv

Input strictly local tree transducers. (English) Zbl 1448.68267

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, 369-381 (2020).
MSC:  68Q45
PDF BibTeX XML Cite
Full Text: DOI

Intersection and union hierarchies of deterministic context-free languages and pumping lemmas. (English) Zbl 1437.68108

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, 341-353 (2020).
MSC:  68Q45
PDF BibTeX XML Cite
Full Text: DOI arXiv

Minimizing GFG transition-based automata. (English) Zbl 07561593

Baier, Christel (ed.) et al., 46th international colloquium on automata, languages, and programming, ICALP 2019, Patras, Greece, July 9–12, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 132, Article 100, 16 p. (2019).
MSC:  68Nxx 68Qxx
PDF BibTeX XML Cite
Full Text: DOI

On the decidability of finding a positive ILP-instance in a regular set of ILP-instances. (English) Zbl 1434.68291

Hospodár, Michal (ed.) et al., Descriptional complexity of formal systems. 21st IFIP WG 1.02 international conference, DCFS 2019, Košice, Slovakia, July 17–19, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11612, 272-284 (2019).
MSC:  68Q45 03B25 90C10
PDF BibTeX XML Cite
Full Text: DOI

Definitions and properties of entropy and distance for regular languages. (English) Zbl 1478.37019

Hawkins, Jane (ed.) et al., Dynamical systems and random processes, 16th Carolina dynamics symposium, Agnes Scott College, Decatur, Georgia, April 13–15, 2018. Providence, RI: American Mathematical Society (AMS). Contemp. Math. 736, 139-169 (2019).
PDF BibTeX XML Cite
Full Text: DOI

The mathematics of urban morphology. With a foreword by Michael Batty. (English) Zbl 1410.91008

Modeling and Simulation in Science, Engineering and Technology. Cham: Birkhäuser (ISBN 978-3-030-12380-2/hbk; 978-3-030-12381-9/ebook). xiii, 564 p. (2019).
PDF BibTeX XML Cite
Full Text: DOI

One theorem to rule them all: a unified translation of LTL into \(\omega \)-automata. (English) Zbl 1497.68259

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). 384-393 (2018).
MSC:  68Q45 03B44 03D05
PDF BibTeX XML Cite
Full Text: DOI arXiv

Deterministic sensing \(5'\rightarrow 3'\) Watson-Crick automata without sensing parameter. (English) Zbl 06958394

Stepney, Susan (ed.) et al., Unconventional computation and natural computation. 17th international conference, UCNC 2018, Fontainebleau, France, June 25–29, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10867, 173-187 (2018).
MSC:  68Q05 68Q10
PDF BibTeX XML Cite
Full Text: DOI

Forward bisimulations for nondeterministic symbolic finite automata. (English) Zbl 1452.68103

Legay, Axel (ed.) et al., Tools and algorithms for the construction and analysis of systems. 23rd international conference, TACAS 2017, held as part of the European joint conferences on theory and practice of software, ETAPS 2017, Uppsala, Sweden, April 22–29, 2017. Proceedings. Part I. Berlin: Springer. Lect. Notes Comput. Sci. 10205, 518-534 (2017).
MSC:  68Q45
PDF BibTeX XML Cite
Full Text: DOI

A novel learning algorithm for Büchi automata based on family of DFAs and classification trees. (English) Zbl 1453.68098

Legay, Axel (ed.) et al., Tools and algorithms for the construction and analysis of systems. 23rd international conference, TACAS 2017, held as part of the European joint conferences on theory and practice of software, ETAPS 2017, Uppsala, Sweden, April 22–29, 2017. Proceedings. Part I. Berlin: Springer. Lect. Notes Comput. Sci. 10205, 208-226 (2017).
MSC:  68Q32 68Q45
PDF BibTeX XML Cite
Full Text: DOI arXiv

Reusable garbled deterministic finite automata from learning with errors. (English) Zbl 1441.68116

Chatzigiannakis, Ioannis (ed.) et al., 44th international colloquium on automata, languages, and programming, ICALP 2017, Warsaw, Poland July 10–14, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 80, Article 36, 13 p. (2017).
MSC:  68Q45 68P25 68Q04
PDF BibTeX XML Cite
Full Text: DOI

Deterministic regular expressions with back-references. (English) Zbl 1402.68115

Vollmer, Heribert (ed.) et al., 34th symposium on theoretical aspects of computer science (STACS 2017), Hannover, Germany, March 8–11, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-028-6). LIPIcs – Leibniz International Proceedings in Informatics 66, Article 33, 14 p. (2017).
MSC:  68Q45
PDF BibTeX XML Cite
Full Text: DOI arXiv

On Büchi one-counter automata. (English) Zbl 1402.68114

Vollmer, Heribert (ed.) et al., 34th symposium on theoretical aspects of computer science (STACS 2017), Hannover, Germany, March 8–11, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-028-6). LIPIcs – Leibniz International Proceedings in Informatics 66, Article 14, 13 p. (2017).
MSC:  68Q45 03D05
PDF BibTeX XML Cite
Full Text: DOI

On minimization of deterministic automaton with rough output. (English) Zbl 1494.68150

Arumugam, S. (ed.) et al., Theoretical computer science and discrete mathematics. First international conference, ICTCSDM 2016, Krishnankoil, India, December 19–21, 2016. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 10398, 383-391 (2017).
MSC:  68Q45 20M35
PDF BibTeX XML Cite
Full Text: DOI

Learning nominal automata. (English) Zbl 1380.68243

Castagna, Giuseppe (ed.) et al., Proceedings of the 44th annual ACM SIGPLAN symposium on principles of programming languages, POPL ’17, Paris, France, January 15–21, 2017. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4660-3). 613-625 (2017).
MSC:  68Q32 68N18 68Q45
PDF BibTeX XML Cite
Full Text: DOI arXiv

Scheduling of embedded controllers under timing contracts. (English) Zbl 1369.93359

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). 131-140 (2017).
MSC:  93C57 68Q45 90B35
PDF BibTeX XML Cite
Full Text: DOI HAL

Past, present, and infinite future. (English) Zbl 1388.03040

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 95, 14 p. (2016).
MSC:  03D05 03B44
PDF BibTeX XML Cite
Full Text: DOI

Behavior of finite-nonstationary deterministic automata in a fuzzy environment. (English. Russian original) Zbl 1420.68110

Vestn. St. Petersbg. Univ., Math. 49, No. 1, 23-33 (2016); translation from Vestn. St-Peterbg. Univ., Ser. I, Mat. Mekh. Astron. 3(61), No. 1, 32-43 (2016).
MSC:  68Q45 93C42
PDF BibTeX XML Cite
Full Text: DOI

Completely reachable automata. (English) Zbl 1435.68145

Câmpeanu, Cezar (ed.) et al., Descriptional complexity of formal systems. 18th IFIP WG 1.2 international conference, DCFS 2016, Bucharest, Romania, July 5–8, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9777, 1-17 (2016).
MSC:  68Q45
PDF BibTeX XML Cite
Full Text: DOI arXiv

Filter Results by …

Document Type

Reviewing State

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software