default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID24th DCFS 2022: Debrecen, Hungary
- Yo-Sub Han
, György Vaszil:
Descriptional Complexity of Formal Systems - 24th IFIP WG 1.02 International Conference, DCFS 2022, Debrecen, Hungary, August 29-31, 2022, Proceedings. Lecture Notes in Computer Science 13439, Springer 2022, ISBN 978-3-031-13256-8 - Stefano Crespi-Reghizzi:
The Alphabetic Complexity in Homomorphic Definitions of Word, Tree and Picture Languages. 1-14 - Duncan Adamson:
Ranking Binary Unlabelled Necklaces in Polynomial Time. 15-29 - Jérôme Durand-Lose:
On the Power of Recursive Word-Functions Without Concatenation. 30-42 - Szilárd Zsolt Fazekas, Robert Mercas:
Clusters of Repetition Roots Forming Prefix Chains. 43-56 - Pamela Fleischmann, Lukas Haschke, Annika Huch, Annika Mayrock, Dirk Nowotka:
Nearly k-Universal Words - Investigating a Part of Simon's Congruence. 57-71 - Viliam Geffert, Dominika Palisínová, Alexander Szabari:
State Complexity of Binary Coded Regular Languages. 72-84 - Stefan Hoffmann:
Reset Complexity and Completely Reachable Automata with Simple Idempotents. 85-99 - Markus Holzer, Christian Rauch:
On the Descriptional Complexity of the Direct Product of Finite Automata. 100-111 - Michal Hospodár, Peter Mlynárcik, Viktor Olejár:
Operations on Subregular Languages and Nondeterministic State Complexity. 112-126 - Sungmin Kim, Yo-Sub Han, Sang-Ki Ko, Kai Salomaa:
On Simon's Congruence Closure of a String. 127-141 - Stavros Konstantinidis, Mitja Mastnak, Nelma Moreira, Rogério Reis:
Approximate NFA Universality Motivated by Information Theory. 142-154 - Orna Kupferman, Asaf Petruschka:
Lazy Regular Sensing. 155-169 - Martin Kutrib, Matthias Wendlandt:
State Complexity of Finite Partial Languages. 170-183 - Hendrik Maarand, Hellis Tamm:
Yet Another Canonical Nondeterministic Automaton. 184-196 - Benedek Nagy:
Union-Complexities of Kleene Plus Operation. 197-211
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 2025-01-03 23:16 CET 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:
