default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInternational Journal of Foundations of Computer Science, Volume 37
Volume 37, Number 1, January 2026
- Benedek Nagy:
Preface. 1-3 - Bernard Boigelot, Pascal Fontaine
, Baptiste Vergain:
Universal First-Order Quantification over Automata. 5-21 - Olga Martynova, Alexander Okhotin:
A Time to Cast Away Stones: On a Family of Pebble Automata. 23-46 - Kevin Lotz, Mitja Kulczynski, Dirk Nowotka, Danny Bøgsted Poulsen, Anders Schlichtkrull:
Certainty in Formalising SMT-LIB for Strings in Isabelle. 47-71 - Joonghyuk Hahn, Hyunjoon Cheon, Yo-Sub Han:
Characterizations of M-Equivalence and Weak M-Relation. 73-92 - Sebastian Maneth, Martin Vu:
Deciding Whether an Attributed Translation can be Realized by a Top-Down Transducer. 93-136 - Michaela Bobenicová, Michal Hospodár, Galina Jirásková:
Operational Complexity in Subregular Classes. 137-165 - Martin Kutrib:
Sweeping Input-Driven Pushdown Automata. 167-191 - Hermann Gruber, Markus Holzer, Christian Rauch:
The Pumping Lemma for Regular Languages is Hard. 193-213 - Václav Blazej, Jan Janousek, Stepán Plachý:
On the Smallest Synchronizing Terms of Finite Tree Automata. 215-239 - Samira Attou, Ludovic Mignot, Clément Miklarz, Florent Nicart:
Constrained Multi-Tildes: Derived Term and Position Automata. 241-268 - Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis:
Average State Complexity of Partial Derivative Automata for Synchronised Shuffles. 269-289
Volume 37, Number 2, February 2026
- Chunhua Cao, Zhongmei Yan, Yali Yang, Hao Xie, Yingheng Li:
Three-Word Codes {a, aba, u} Having a Finite Completion. 291-305 - Qin Zhao, Xiaohui Hua:
The h-Faulty-Block Connectivity of n-Dimensional Balanced Hypercube. 307-323 - Diane Castonguay, Elisângela Silva Dias, Fernanda Neiva Mesquita, Julliano R. Nascimento:
Computing a 3-Role Assignment is Polynomial-Time Solvable on Complementary Prisms. 325-348 - Ahmet Bilal Uçan:
Multi-Head Two-Way Finite Automata with Advice. 349-360 - Merina Aruja, Lisa Mathew, Jayakrishna Vijayakumar:
Sufficiency Conditions for Well-Formedness of Quantum Context-Free Grammars. 361-378 - Jürgen Dassow:
On Deterministic Finite Automata Equipped with Partial Orders. 379-398
Volume 37, Number 3, April 2026
- Lingmei Xiao, Vladimir Edemskiy, Chenhuang Wu:
A Lower Bound on the 2-Adic Complexity of Hall's Sextic Residue Sequences. 399-412 - Li Wang, Liqing Lin, Yanxia Zhao:
The k-Regular Edge Connectivity of Three Types of Regular Graphs. 413-427 - Tongtong Ding, Ruichao Niu, Min Xu, Jou-Ming Chang:
The g-Extra Mixed Connectivity of Hypercube-Like Networks. 429-448 - Wantao Ning, Rongshuan Geng:
The Generalized 4-Connectivity of Locally Exchanged Twisted Cubes. 449-465 - Shiying Wang, Huiying Zhang, Lina Zhao, Shangwei Lin:
Edge-Fault-Tolerant Edge-Bipancyclicity of Modified Bubble-Sort Graphs. 467-484 - Yan-Ping Wang, Zhengbang Zha:
The 0-APN Power Functions over 픽2n and Their Applications to Linear Codes. 485-512
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 2026-05-19 22:24 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:
