Imagen de Portada

Illustrating Finite Automata with Grail+ and TikZ

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	May, Alastair, Smith, Taylor J.
Formato:	Preprint
Publicado:	2024
Materias:	Formal Languages and Automata Theory 68-04 (primary), 68Q45 (secondary)
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Improved Randomized Approximation of Hard Universality and Emptiness Problems
por: Andreou, Pantelis, et al.
Publicado: (2024)

Bandwidth of Nondeterministic Finite Automata
por: Cho, Da-Jung, et al.
Publicado: (2026)

A generalization of Deterministic Finite Automata related to discharging
por: Campbell, John M.
Publicado: (2025)

Primitive Two-Dimensional Words and Iterated Pedal Triangles via Symbolic Coding
por: Smith, Taylor J.
Publicado: (2026)

An $L^{\#}$ Based Algorithm for Active Learning of Minimal Separating Automata
por: Laumen, Jasper, et al.
Publicado: (2026)

On the Intersection Problem for Quantum Finite Automata
por: Benso, Andrea, et al.
Publicado: (2024)

Languages given by Finite Automata over the Unary Alphabet
por: Czerwiński, Wojciech, et al.
Publicado: (2023)

Semidirect Product Decompositions for Periodic Regular Languages
por: Inoue, Yusuke, et al.
Publicado: (2024)

A hierarchy of reversible finite automata
por: Radionova, Maria, et al.
Publicado: (2024)

On Computational Completeness of Semi-Conditional Matrix Grammars
por: Fernau, Henning, et al.
Publicado: (2024)

Nondeterministic tree-walking automata are not closed under complementation
por: Martynova, Olga, et al.
Publicado: (2024)

A lower bound on the state complexity of transforming two-way nondeterministic finite automata to unambiguous finite automata
por: Petrov, Semyon, et al.
Publicado: (2024)

Mostowski Index via extended register games
por: Idir, Olivier, et al.
Publicado: (2024)

Linear equations and recursively enumerable sets
por: Honkala, Juha
Publicado: (2024)

A quadratic upper bound on the reset thresholds of synchronizing automata containing a transitive permutation group
por: Zhu, Yinfeng
Publicado: (2024)

Around Don's conjecture for binary completely reachable automata
por: Zhu, Yinfeng
Publicado: (2024)

From regular expressions to deterministic finite automata: $2^{\frac{n}{2}+\sqrt{n}(\log n)^{Θ(1)}}$ states are necessary and sufficient
por: Martynova, Olga, et al.
Publicado: (2025)

Bounded Languages Described by GF(2)-grammars
por: Makarov, Vladislav
Publicado: (2019)

Don's conjecture for binary completely reachable automata: an approach and its limitations
por: Casas, David, et al.
Publicado: (2023)

Hypernode Automata
por: Bartocci, Ezio, et al.
Publicado: (2023)

Decomposition of Automata recognizing Ideals
por: Berry, Mathias, et al.
Publicado: (2026)

Deterministic Suffix-reading Automata
por: Keerthan, R, et al.
Publicado: (2025)

Learning Automata with Name Allocation
por: Frank, Florian, et al.
Publicado: (2025)

Alternating Nominal Automata with Name Allocation
por: Frank, Florian, et al.
Publicado: (2024)

Nominal Tree Automata With Name Allocation
por: Prucker, Simon, et al.
Publicado: (2024)

On A. V. Anisimov's problem for finding a polynomial algorithm checking inclusion of context-free languages in group languages
por: Yordzhev, Krasimir
Publicado: (2026)

List of Results on the Černý Conjecture and Reset Thresholds for Synchronizing Automata
por: Volkov, Mikhail V.
Publicado: (2025)

Deciding Sparseness of Regular Languages of Finite Trees and Infinite Words
por: Eickmeyer, Kord, et al.
Publicado: (2025)

Polynomial Complementation of Nondeterministic 2-Way Finite Automata by 1-Limited Automata
por: Guillon, Bruno, et al.
Publicado: (2025)

On the Equivalence Checking Problem for Deterministic Top-Down Tree Automata
por: Deng, Zhibo, et al.
Publicado: (2025)

A Unary-to-Nonunary Transition in the Accepting-State Spectrum of Right Quotient for Permutation Automata
por: German, Samuel
Publicado: (2026)

On Quantum Context-Free Grammars
por: Aruja, Merina, et al.
Publicado: (2025)

Input-Erasing Two-Way Finite Automata
por: Meduna, Alexander, et al.
Publicado: (2025)

A polynomial-time algorithm for the automatic Baire property
por: Staiger, Ludwig
Publicado: (2025)

On Languages Describing Large Graph Classes
por: Fernau, Henning, et al.
Publicado: (2026)

A note on Automatic Baire property
por: Staiger, Ludwig
Publicado: (2025)

Dissecting power of intersection of two context-free languages
por: Rukavicka, Josef
Publicado: (2020)

Weakly-unambiguous Parikh automata and their link to holonomic series
por: Bostan, Alin, et al.
Publicado: (2025)

Jump Complexity of Deterministic Finite Automata with Translucent Letters
por: Fazekas, Szilárd Zsolt, et al.
Publicado: (2025)

Addition Automata and Attractors of Digit Systems Corresponding to Expanding Rational Matrices
por: Cruz, Anjelo Gabriel R., et al.
Publicado: (2025)