„deterministic automaton“

Suchergebnisse

1.000+ Treffer

• Implementation and Application of Automata – 17th International Conference, CIAA 2012, Porto, Portugal, July 17-20, 2012. Proceedings
  Moreira, Nelma ; Reis, Rogério 2012 Springer Berlin Heidelberg
• Shortest characteristic factors of a deterministic finite automaton and computing its positive position run by pattern set matching
  Janoušek, Jan ; Plachý, Štěpán
• A Quadratic Upper Bound on the Reset Thresholds of Synchronizing Automata Containing a Transitive Permutation Group
  Zhu, Yinfeng 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Gathering Teams of Deterministic Finite Automata on a Line
  Gao, Younan ; Pelc, Andrzej 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Decomposing Finite Languages
  Spenner, Daniel Alexander 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• One Drop of Non-Determinism in a Random Deterministic Automaton
  Carayol, Arnaud ; Duchon, Philippe ; Koechlin, Florent ; Nicaud, Cyril 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The Simplest Non-Regular Deterministic Context-Free Language
  Jančar, Petr ; Šíma, Jiří 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Synchronizing Deterministic Push-Down Automata Can Be Really Hard
  Fernau, Henning ; Wolf, Petra ; Yamakami, Tomoyuki 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Existential Length Universality
  Gawrychowski, Paweł ; Lange, Martin ; Rampersad, Narad ; Shallit, Jeffrey ; Szykuła, Marek 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Complexity of Preimage Problems for Deterministic Finite Automata
  Berlinkov, Mikhail V. ; Ferens, Robert ; Szykula, Marek 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Superpolynomial Lower Bound for the Size of Non-Deterministic Complement of an Unambiguous Automaton
  Raskin, Mikhail 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Deterministic Regular Expressions with Back-References
  Freydenberger, Dominik D. ; Schmid, Markus L. 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Distribution of the number of accessible states in a random deterministic automaton
  Carayol, Arnaud ; Nicaud, Cyril 2012 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Efficient Minimization of DFAs with Partial Transition
  Valmari, Antti ; Lehtinen, Petri 2008 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The Cellular Automaton Interpretation of Quantum Mechanics
  Hooft, Gerard ˜'tœ 2016 Springer International Publishing
• Deterministic automata for extended regular expressions
  Syzdykov, Mirzakhmet
• Some open problems in the theory of computation as questions about two-way deterministic pushdown automaton languages
  Galil, Zvi
• An adaptive detection model for IPv6 extension header threats based on deterministic decision automaton
  Lin, Bin ; Zhang, Liancheng ; Zhang, Hongtao ; Guo, Yi ; Ge, Shaowei ; Fang, Yakai ; Ren, Mingyue
• A deterministic sandpile automaton revisited
  Lübeck, S. ; Rajewsky, N. ; Wolf, D.E
• Model reformulation for conflict-free routing problems using Petri Net and Deterministic Finite Automaton
  Nakamura, Ryosuke ; Sawada, Kenji ; Shin, Seiichi ; Kumagai, Kenji ; Yoneda, Hisato