:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Makarov, Vladislav
Format:	Preprint
Published:	2019
Subjects:	Formal Languages and Automata Theory 68Q45
Online Access:	https://arxiv.org/abs/1912.13401
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

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

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

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

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

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

Linear equations and recursively enumerable sets
by: Honkala, Juha
Published: (2024)

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

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

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

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

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

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

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

A note on Automatic Baire property
by: Staiger, Ludwig
Published: (2025)

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

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

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

Illustrating Finite Automata with Grail+ and TikZ
by: May, Alastair, et al.
Published: (2024)

Eve-positional languages: putting order into Büchi automata
by: Idir, Olivier
Published: (2026)

Decomposition of Automata recognizing Ideals
by: Berry, Mathias, et al.
Published: (2026)

Deterministic Suffix-reading Automata
by: Keerthan, R, et al.
Published: (2025)

On universality of regular realizability problems
by: Rubtsov, Alexander, et al.
Published: (2023)

Runs, Squares, Palindromes, and Unbordered Factors of a Family of Binary Pattern Sequences with the All-One Pattern
by: Hendel, Russell Jay
Published: (2025)

Learning Automata with Name Allocation
by: Frank, Florian, et al.
Published: (2025)

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

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

Hypernode Automata
by: Bartocci, Ezio, et al.
Published: (2023)

Using games and universal trees to characterise the nondeterministic index of tree languages
by: Idir, Olivier, et al.
Published: (2025)

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

An algebraic characterisation of Eve-positional languages
by: Colcombet, Thomas, et al.
Published: (2026)

Generalized Parikh Matrices For Tracking Subsequence Occurrences
by: Fazekas, Szilárd Zsolt, et al.
Published: (2024)

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

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

Hamming distance between finite transducers
by: Dartois, Luc, et al.
Published: (2026)

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

Permutation closure for multiple context-free languages
by: Duncan, Andrew, et al.
Published: (2025)