8 research outputs found

    Reset Complexity of Ideal Languages over a Binary Alphabet

    Full text link
    We prove PSPACE-completeness of checking whether a given ideal language serves as the language of reset words for some automaton with at most four states over a binary alphabet. We compare the reset complexity and the state complexity for languages related to slowly synchronizing automata. © 2019 World Scientific Publishing Company.Russian Foundation for Basic Research, RFBR: 16-01-00795Ministry of Education and Science of the Russian Federation, Minobrnauka: 1.3253.2017Ural Federal University, UrFUThe author acknowledges anonymous reviewers for comments and suggestions. Also the author acknowledges support by the Russian Foundation for Basic Research, Grant No. 16-01-00795, the Ministry of Education and Science of the Russian Federation, Project No. 1.3253.2017, and the Competitiveness Enhancement Program of Ural Federal University

    Reset complexity of ideal languages over a binary alphabet

    Full text link
    We prove PSPACE-completeness of checking whether a given ideal language serves as the language of reset words for some automaton with at most four states over a binary alphabet. © IFIP International Federation for Information Processing 2017

    Completely Reachable Automata: A Polynomial Algorithm and Quadratic Upper Bounds

    Get PDF

    Completely Reachable Automata: An Interplay between Automata, Graphs, and Trees

    Get PDF
    A deterministic finite automaton in which every non-empty set of states occurs as the image of the whole state set under the action of a suitable input word is called completely reachable. We characterize such automata in terms of graphs and trees. © 2023 World Scientific Publishing Company.Ministry of Education and Science of the Russian Federation, Minobrnauka: FEUZ-2023-0022The authors were supported by the Ministry of Science and Higher Education of the Russian Federation, project FEUZ-2023-0022

    Synchronization of finite automata

    Get PDF
    A survey of the state-of-the-art of the theory of synchronizing automata is given in its part concerned with the case of complete deterministic automata. Algorithmic and complexity-theoretic aspects are considered, the existing results related to Černý’s conjecture and methods for their derivation are presented. Bibliography: 193 titles. © 2022 Russian Academy of Sciences, Steklov Mathematical Institute of RAS.Russian Foundation for Basic Research, РФФИ, (19-11-50120)Ministry of Education and Science of the Russian Federation, Minobrnauka, (FEUZ-2020-0016)This research was supported by the Russian Foundation for Basic Research under grant no. 19-11-50120 and by the Ministry of Science and Higher Education of the Russian Federation (project no. FEUZ-2020-0016)

    LIPIcs, Volume 261, ICALP 2023, Complete Volume

    Get PDF
    LIPIcs, Volume 261, ICALP 2023, Complete Volum

    Descriptional Complexity of Formal Systems

    No full text
    The proceedings contain 24 papers. The special focus in this conference is on Descriptional Complexity of Formal Systems. The topics include: Sensing as a complexity measure; avoiding overlaps in pictures; on the degree of nondeterminism of tree adjoining languages and head grammar languages; on the average complexity of strong star normal form; most complex non-returning regular languages; uncountable realtime probabilistic classes; a parametrized analysis of algorithms on hierarchical graphs; graph-controlled insertion-deletion systems generating language classes beyond linearity; computational completeness of networks of evolutionary processors with elementary polarizations and a small number of processors; self-attraction removal from oritatami systems; one-time nondeterministic computations; branching measures and nearly acyclic NFAS; a pumping lemma for ordered restarting automata; concise representations of reversible automata; reset complexity of ideal languages over a binary alphabet; state complexity of suffix distance and the quotient operation on input driven pushdown automata
    corecore