Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation and Computation, Volume 295
Volume 295, Number Part B, December 2023
- Henning Fernau
, Petra Wolf, Tomoyuki Yamakami:
Synchronizing deterministic push-down automata can be really hard. 105089 - Cai-Xia Wang, Yu Yang, Shou-Jun Xu:
Algorithmic aspects of secure domination in unit disk graphs. 105090 - Spyros Angelopoulos:
Online search with a hint. 105091 - Jean Néraud:
Topologies for error-detecting variable-length codes. 105092 - Peter Kostolányi:
Bideterministic weighted automata. 105093 - Fan Feng, Andreas Maletti:
Weighted two-way transducers. 105094 - Masahiro Hamano:
A linear exponential comonad in s-finite transition kernels and probabilistic coherent spaces. 105109 - Jinshan Zhang, Bo Tang, Jianwei Yin:
Exchange of indivisible goods under matroid constraints. 105110 - Martin Berglund, Henrik Björklund, Johanna Björklund, Adrien Boiret:
Transduction from trees to graphs through folding. 105111 - Ari Shaller, Linir Zamir, Mehrdad Nojoumian:
Roadmap of post-quantum cryptography standardization: Side-channel attacks and countermeasures. 105112 - Giovanni Pighizzini, Branislav Rovan, Simon Sádovský:
Usefulness of information and decomposability of unary regular languages. 104868 - Mikhail Mrykhin, Alexander Okhotin:
On hardest languages for one-dimensional cellular automata. 104891 - David R. Bélanger, Ziyuan Gao, Sanjay Jain, Wei Li, Frank Stephan:
Learnability and positive equivalence relations. 104913 - Fabian Birkmann, Stefan Milius, Henning Urbat:
Eilenberg's variety theorem without Boolean operations. 104916 - Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis:
Location automata for regular expressions with shuffle and intersection. 104917 - Borzoo Bonakdarpour, Sarai Sheinvald:
Finite-word hyperlanguages. 104944 - Semyon Petrov, Alexander Okhotin:
On the transformation of two-way finite automata to unambiguous finite automata. 104956 - Frits W. Vaandrager, Masoud Ebrahimi, Roderick Bloem:
Learning Mealy machines with one timer. 105013 - Stefan Hoffmann:
Binary and circular automata having maximal state complexity for the set of synchronizing words. 105076 - Stefan Hoffmann:
New characterizations of primitive permutation groups with applications to synchronizing automata. 105086 - Jens Oliver Gutsfeld, Markus Müller-Olm, Christian Dielitz:
Temporal logics with language parameters. 105087
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-07-17 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
