×

Found 894 Documents (Results 1–100)

100
MathJax

A framework for the analysis of supervised discrete event systems under attack. (English) Zbl 07624889

Zattoni, Elena (ed.) et al., 15th European workshop on advanced control and diagnosis, ACD 2019. Proceedings of the workshop, Bologna, Italy, November 21–22, 2019. Cham: Springer. Lect. Notes Control Inf. Sci. – Proc., 529-546 (2022).
MSC:  93-XX
PDF BibTeX XML Cite
Full Text: DOI arXiv

The isomorphism problem for FST injection structures. (English) Zbl 07551709

Artemov, Sergei (ed.) et al., Logical foundations of computer science. International symposium, LFCS 2022, Deerfield Beach, FL, USA, January 10–13, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13137, 25-36 (2022).
MSC:  03B70
PDF BibTeX XML Cite
Full Text: DOI

State complexity investigations on commutative languages – the upward and downward closure, commutative aperiodic and commutative group languages. (English) Zbl 07614742

Han, Yo-Sub (ed.) et al., Descriptional complexity of formal systems. 23rd IFIP WG 1.02 international conference, DCFS 2021, virtual event, September 5, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13037, 64-75 (2021).
MSC:  68Qxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

Deterministic one-way simulation of two-way deterministic finite automata over small alphabets. (English) Zbl 07614739

Han, Yo-Sub (ed.) et al., Descriptional complexity of formal systems. 23rd IFIP WG 1.02 international conference, DCFS 2021, virtual event, September 5, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13037, 26-37 (2021).
MSC:  68Qxx
PDF BibTeX XML Cite
Full Text: DOI

Quantum logical depth and shallowness of streaming data by one-way quantum finite-state transducers (preliminary report). (English) Zbl 07553911

Kostitsyna, Irina et al., Unconventional computation and natural computation. 19th international conference, UCNC 2021, Espoo, Finland, October 18–22, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12984, 177-193 (2021).
PDF BibTeX XML Cite
Full Text: DOI

Communicating finite state machines and an extensible toolchain for multiparty session types. (English) Zbl 1487.68168

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, 18-35 (2021).
MSC:  68Q85 68N19 68Q45
PDF BibTeX XML Cite
Full Text: DOI

Learning probabilistic automata using residuals. (English) Zbl 07500650

Cerone, Antonio (ed.) et al., Theoretical aspects of computing – ICTAC 2021. 18th international colloquium, virtual event, Nur-Sultan, Kazakhstan, September 8–10, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12819, 295-313 (2021).
MSC:  68Qxx
PDF BibTeX XML Cite
Full Text: DOI Link

State complexity of projection on languages recognized by permutation automata and commuting letters. (English) Zbl 07498726

Moreira, Nelma (ed.) et al., Developments in language theory. 25th international conference, DLT 2021, Porto, Portugal, August 16–20, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12811, 192-203 (2021).
MSC:  68Q45
PDF BibTeX XML Cite
Full Text: DOI arXiv

Complexity and categoricity of injection structures induced by finite state transducers. (English) Zbl 07495160

De Mol, Liesbeth (ed.) et al., Connecting with computability. 17th conference on computability in Europe, CiE 2021, virtual event, Ghent, Belgium, July 5–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12813, 106-119 (2021).
MSC:  68Qxx
PDF BibTeX XML Cite
Full Text: DOI

State complexity of permutation and related decision problems on alphabetical pattern constraints. (English) Zbl 07495109

Maneth, Sebastian (ed.), Implementation and application of automata. 25th international conference, CIAA 2021, virtual event, July 19–22, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12803, 115-126 (2021).
MSC:  68Q45
PDF BibTeX XML Cite
Full Text: DOI arXiv

A string diagrammatic axiomatisation of finite-state automata. (English) Zbl 07410439

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, 469-489 (2021).
MSC:  68Nxx 68Qxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

State complexity of the set of synchronizing words for circular automata and automata over binary alphabets. (English) Zbl 07405997

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

Completely reachable automata, primitive groups and the state complexity of the set of synchronizing words. (English) Zbl 07405996

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

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

Synthesizing context-free grammars from recurrent neural networks. (English) Zbl 1467.68077

Groote, Jan Friso (ed.) et al., Tools and algorithms for the construction and analysis of systems. 27th international conference, TACAS 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. Part I. Cham: Springer. Lect. Notes Comput. Sci. 12651, 351-369 (2021).
PDF BibTeX XML Cite
Full Text: DOI arXiv

Four heads are better than three. (English) Zbl 07370038

Zenil, Hector (ed.), Cellular automata and discrete complex systems. 26th IFIP WG 1.5 international workshop, AUTOMATA 2020, Stockholm, Sweden, August 10–12, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12286, 111-125 (2020).
MSC:  68Q80
PDF BibTeX XML Cite
Full Text: DOI arXiv

Correctly slicing extended finite state machines. (English) Zbl 1440.68149

Di Pierro, Alessandra (ed.) et al., From lambda calculus to cybersecurity through program analysis. Essays dedicated to Chris Hankin on the occasion of his retirement. Cham: Springer. Lect. Notes Comput. Sci. 12065, 149-197 (2020).
MSC:  68Q45 68Q55
PDF BibTeX XML Cite
Full Text: DOI

Estimation and inference in discrete event systems. A model-based approach with finite automata. (English) Zbl 1436.93002

Communications and Control Engineering. Cham: Springer (ISBN 978-3-030-30820-9/hbk; 978-3-030-30821-6/ebook). xviii, 346 p. (2020).
PDF BibTeX XML Cite
Full Text: DOI Link

Formal methods in computer science. (English) Zbl 1436.68002

Textbooks in Mathematics. Boca Raton, FL: CRC Press (ISBN 978-0-367-22570-4/hbk; 978-1-4987-7532-8/pbk; 978-0-429-18418-5/ebook). xvii, 294 p. (2020).
PDF BibTeX XML Cite
Full Text: DOI

Two-head finite-state acceptors with translucent letters. (English) Zbl 1444.68099

Catania, Barbara (ed.) et al., SOFSEM 2019: theory and practice of computer science. 45th international conference on current trends in theory and practice of computer science, Nový Smokovec, Slovakia, January 27–30, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11376, 406-418 (2019).
MSC:  68Q45
PDF BibTeX XML Cite
Full Text: DOI

State complexity of single-word pattern matching in regular languages. (English) Zbl 1434.68238

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, 86-97 (2019).
MSC:  68Q45
PDF BibTeX XML Cite
Full Text: DOI

Two-dimensional pattern matching against basic picture languages. (English) Zbl 1434.68278

Hospodár, Michal (ed.) et al., Implementation and application of automata. 24th international conference, CIAA 2019, Košice, Slovakia, July 22–25, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11601, 209-221 (2019).
MSC:  68Q45
PDF BibTeX XML Cite
Full Text: DOI

Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice. (English) Zbl 1425.68238

Martín-Vide, Carlos (ed.) et al., Language and automata theory and applications. 13th international conference, LATA 2019, St. Petersburg, Russia, March 26–29, 2019, Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11417, 134-145 (2019).
MSC:  68Q45 68Q12 81P68
PDF BibTeX XML Cite
Full Text: DOI arXiv

Structural classification of methods for synthesis of a microprogram finite-state machine with datapath of transitions. (English. Russian original) Zbl 1443.68081

Cybern. Syst. Anal. 55, No. 2, 167-173 (2019); translation from Kibern. Sist. Anal. 2019, No. 2, 3-9 (2019).
MSC:  68Q45
PDF BibTeX XML Cite
Full Text: DOI

Finite-state techniques. Automata, transducers and bimachines. (English) Zbl 1465.68006

Cambridge Tracts in Theoretical Computer Science 60. Cambridge: Cambridge University Press (ISBN 978-1-108-48541-8/hbk; 978-1-108-75694-5/ebook). x, 304 p. (2019).
PDF BibTeX XML Cite
Full Text: DOI

Algorithmics of nonuniformity: tools and paradigms. (English) Zbl 1402.68004

Discrete Mathematics and its Applications. Boca Raton, FL: CRC Press (ISBN 978-1-4987-5071-4/hbk; 978-1-4987-5072-1/ebook). xix, 569 p. (2019).
PDF BibTeX XML Cite
Full Text: Link

Selecting a leader in a network of finite state machines. (English) Zbl 07561256

Schmid, Ulrich (ed.) et al., 32nd international symposium on distributed computing, DISC 2018, New Orleans, Louisiana, USA, October 15–19, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 121, Article 4, 17 p. (2018).
MSC:  68M14 68Q10 68Q45
PDF BibTeX XML Cite
Full Text: DOI arXiv

It is easy to be wise after the event: communicating finite-state machines capture first-order logic with “happened before”. (English) Zbl 1487.68163

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 7, 17 p. (2018).
MSC:  68Q85 03B70 68Q45
PDF BibTeX XML Cite
Full Text: DOI arXiv

Rabin vs. Streett automata. (English) Zbl 1491.68095

Lokam, Satya (ed.) et al., 37th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2017, IIT Kanpur, India, December 12–14, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 93, Article 17, 15 p. (2018).
MSC:  68Q45
PDF BibTeX XML Cite
Full Text: DOI

Secure diagnosability of hybrid dynamical systems. (English) Zbl 1455.93091

Sayed-Mouchaweh, Moamar (ed.), Diagnosability, security and safety of hybrid dynamic and cyber-physical systems. Cham: Springer. 175-200 (2018).
MSC:  93C30 68Q45
PDF BibTeX XML Cite
Full Text: DOI

Communicating finite-state machines and two-variable logic. (English) Zbl 1487.68140

Niedermeier, Rolf (ed.) et al., 35th symposium on theoretical aspects of computer science, STACS 2018, Caen, France, February 28 – March 3, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 96, Article 17, 14 p. (2018).
PDF BibTeX XML Cite
Full Text: DOI arXiv

Minimizing the finite-state machines by using the values of input variables for coding the internal states. (English. Russian original) Zbl 1411.93113

J. Comput. Syst. Sci. Int. 57, No. 5, 738-749 (2018); translation from Izv. Ross. Akad. Nauk, Teor. Sist. Upravl. 2018, No. 5, 76-88 (2018).
PDF BibTeX XML Cite
Full Text: DOI

Models and algorithms of automata theory for the control of an aircraft group. (English. Russian original) Zbl 1406.93229

Autom. Remote Control 79, No. 10, 1863-1870 (2018); translation from Avtom. Telemekh. 2018, No. 10, 154-163 (2018).
PDF BibTeX XML Cite
Full Text: DOI

Determining the area of efficient application of a microprogrammed finite-state machine with datapath of transitions. (English. Russian original) Zbl 1401.68143

Cybern. Syst. Anal. 54, No. 3, 366-375 (2018); translation from Kibern. Sist. Anal. 2018, No. 3, 27-37 (2018).
MSC:  68Q45 94C10
PDF BibTeX XML Cite
Full Text: DOI

Consensus decoding of recurrent neural network basecallers. (English) Zbl 1392.92008

Jansson, Jesper (ed.) et al., Algorithms for computational biology. 5th international conference, ALCoB 2018, Hong Kong, China, June 25–26, 2018. Proceedings. Cham: Springer (ISBN 978-3-319-91937-9/pbk; 978-3-319-91938-6/ebook). Lecture Notes in Computer Science 10849. Lecture Notes in Bioinformatics, 128-139 (2018).
PDF BibTeX XML Cite
Full Text: DOI

Filter Results by …

Document Type

Reviewing State

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Classification

all top 3

Software