×

Found 3,742 Documents (Results 1–100)

When is context-freeness distinguishable from regularity? An extension of Parikh’s theorem. (English) Zbl 07810932

Nagy, Benedek (ed.), Implementation and application of automata. 27th international conference, CIAA 2023, Famagusta, North Cyprus, September 19–22, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 14151, 166-178 (2023).
MSC:  68Q45
PDFBibTeX XMLCite
Full Text: DOI

A Myhill-Nerode theorem for finite state matrix automata and finite matrix languages. (English) Zbl 1528.68190

Barneva, Reneta P. (ed.) et al., Combinatorial image analysis. 21st international workshop, IWCIA 2022, Messina, Italy, July 13–15, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13348, 154-170 (2023).
MSC:  68Q45
PDFBibTeX XMLCite
Full Text: DOI

A matrix method for detecting formal solutions to the problem of algebraic synthesis of a finite-state machine with a datapath of transitions. (English. Ukrainian original) Zbl 1510.68006

Cybern. Syst. Anal. 59, No. 2, 190-198 (2023); translation from Kibern. Sist. Anal. 59, No. 2, 18-26 (2023).
MSC:  68M07 68Q45
PDFBibTeX XMLCite
Full Text: DOI

Poster abstract: Controller synthesis for nonlinear stochastic games via approximate probabilistic relations. (English) Zbl 07807733

Proceedings of the 25th ACM international conference on hybrid systems: computation and control, HSCC 2022, part of CPS-IoT week, Milan, Italy and virtual, May 4–6, 2022. New York, NY: Association for Computing Machinery (ACM). Paper No. 25, 2 p. (2022).
MSC:  68Q45 68Q60 93C30
PDFBibTeX XMLCite
Full Text: DOI

State identification and verification with satisfaction. (English) Zbl 1524.68176

Jansen, Nils (ed.) et al., A journey from process algebra via timed automata to model learning. Essays dedicated to Frits Vaandrager on the occasion of his 60th birthday. Cham: Springer. Lect. Notes Comput. Sci. 13560, 450-466 (2022).
MSC:  68Q45 68Q60 68R07
PDFBibTeX XMLCite
Full Text: DOI

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
PDFBibTeX XMLCite
Full Text: DOI

Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA. (English) Zbl 1509.68082

Ateniese, Giuseppe (ed.) et al., Applied cryptography and network security. 20th international conference, ACNS 2022, Rome, Italy, June 20–23, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13269, 605-625 (2022).
MSC:  68Q10 68Q45 94A60
PDFBibTeX XMLCite
Full Text: DOI

Learning finite state models from recurrent neural networks. (English) Zbl 1502.68263

ter Beek, Maurice H. (ed.) et al., Integrated formal methods. 17th international conference, IFM 2022, Lugano, Switzerland, June 7–10, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13274, 229-248 (2022).
MSC:  68T05 68Q32 68Q45
PDFBibTeX XMLCite
Full Text: DOI

Real-time, constant-space, constant-randomness verifiers. (English) Zbl 07572324

Caron, Pascal (ed.) et al., Implementation and application of automata. 26th international conference, CIAA 2022, Rouen, France, June 28 – July 1, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13266, 212-224 (2022).
MSC:  68Q45
PDFBibTeX XMLCite
Full Text: DOI arXiv

Energy complexity of regular language recognition. (English) Zbl 07572323

Caron, Pascal (ed.) et al., Implementation and application of automata. 26th international conference, CIAA 2022, Rouen, France, June 28 – July 1, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13266, 200-211 (2022).
MSC:  68Q45
PDFBibTeX XMLCite
Full Text: DOI arXiv

Nondeterministic state complexity of site-directed deletion. (English) Zbl 07572322

Caron, Pascal (ed.) et al., Implementation and application of automata. 26th international conference, CIAA 2022, Rouen, France, June 28 – July 1, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13266, 189-199 (2022).
MSC:  68Q45
PDFBibTeX XMLCite
Full Text: DOI

Branching automata and pomset automata. (English) Zbl 07799615

Bojańczyk, Mikołaj (ed.) et al., 41st IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2021, virtual conference, December 15–17, 2021. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 213, Article 37, 13 p. (2021).
MSC:  68N30 68Qxx
PDFBibTeX XMLCite
Full Text: DOI

A polynomial-time approximation algorithm for counting words accepted by an NFA. (English) Zbl 07765139

Khuller, Samir (ed.) et al., Proceedings of the 53rd annual ACM SIGACT symposium on theory of computing, STOC ’21, virtual, Italy, June 21–25, 2021. New York, NY: Association for Computing Machinery (ACM). 4 (2021).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI

Decomposing permutation automata. (English) Zbl 07730620

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 18, 19 p. (2021).
MSC:  68Q85
PDFBibTeX XMLCite
Full Text: DOI arXiv

Support of an algebraic series as the range of a recursive sequence. (English) Zbl 1498.11082

Bostan, Alin (ed.) et al., Transcendence in algebra, combinatorics, geometry and number theory. TRANS19 – transient transcendence in Transylvania, Brașov, Romania, May 13–17, 2019. Revised and extended contributions. Cham: Springer. Springer Proc. Math. Stat. 373, 437-449 (2021).
MSC:  11B85 68Q45
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

Database

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

Biographic Reference

all top 3

Software