scholarly journals State Complexity of Projection on Languages Recognized by Permutation Automata and Commuting Letters

2021 ◽  
pp. 192-203
Author(s):  
Stefan Hoffmann
Keyword(s):  
State Complexity

On the state complexity of intersection of regular languages

1991 ◽  
Vol 22 (3) ◽  
pp. 52-54 ◽  
Author(s):  
Sheng Yu ◽  
Qingyu Zhuang
Keyword(s):  
The State ◽  
Regular Languages ◽  
State Complexity

scholarly journals Lower bounds for the state complexity of probabilistic languages and the language of prime numbers

2020 ◽  
Vol 30 (1) ◽  
pp. 175-192
Author(s):  
NathanaËl Fijalkow
Keyword(s):  
Lower Bound ◽  
Lower Bounds ◽  
Prime Numbers ◽  
Regular Languages ◽  
Automata Theory ◽  
Seminal Paper ◽  
Probabilistic Automata ◽  
State Complexity ◽  
Probabilistic Languages ◽  
Alternating Automata

Abstract This paper studies the complexity of languages of finite words using automata theory. To go beyond the class of regular languages, we consider infinite automata and the notion of state complexity defined by Karp. Motivated by the seminal paper of Rabin from 1963 introducing probabilistic automata, we study the (deterministic) state complexity of probabilistic languages and prove that probabilistic languages can have arbitrarily high deterministic state complexity. We then look at alternating automata as introduced by Chandra, Kozen and Stockmeyer: such machines run independent computations on the word and gather their answers through boolean combinations. We devise a lower bound technique relying on boundedly generated lattices of languages, and give two applications of this technique. The first is a hierarchy theorem, stating that there are languages of arbitrarily high polynomial alternating state complexity, and the second is a linear lower bound on the alternating state complexity of the prime numbers written in binary. This second result strengthens a result of Hartmanis and Shank from 1968, which implies an exponentially worse lower bound for the same model.

On-Wire Conversion Chemistry: Engineering Solid-State Complexity into Striped Metal Nanowires using Solution Chemistry Reactions

2008 ◽  
Vol 130 (43) ◽  
pp. 14042-14043 ◽  
Author(s):  
Mary E. Anderson ◽  
Matthew R. Buck ◽  
Ian T. Sines ◽  
Karl D. Oyler ◽  
Raymond E. Schaak
Keyword(s):  
Solid State ◽  
Solution Chemistry ◽  
Metal Nanowires ◽  
State Complexity

scholarly journals Algebraic and Combinatorial Tools for State Complexity : Application to the Star-Xor Problem

2019 ◽  
Vol 305 ◽  
pp. 154-168
Author(s):  
Pascal Caron ◽  
Edwin Hamel-de le Court ◽  
Jean-Gabriel Luque
Keyword(s):  
State Complexity ◽  
Xor Problem

The state complexity of and its connection with temporal logic

1996 ◽  
Vol 58 (4) ◽  
pp. 185-188 ◽  
Author(s):  
Jean-Camille Birget
Keyword(s):  
Temporal Logic ◽  
The State ◽  
State Complexity

scholarly journals State Complexity of Neighbourhoods and Approximate Pattern Matching

2018 ◽  
Vol 29 (02) ◽  
pp. 315-329 ◽  
Author(s):  
Timothy Ng ◽  
David Rappaport ◽  
Kai Salomaa
Keyword(s):  
Lower Bound ◽  
Pattern Matching ◽  
Finite Automaton ◽  
The State ◽  
Worst Case ◽  
State Complexity ◽  
Approximate Pattern Matching ◽  
The Given ◽  
Nondeterministic Finite Automaton ◽  
Distance Formula

The neighbourhood of a language [Formula: see text] with respect to an additive distance consists of all strings that have distance at most the given radius from some string of [Formula: see text]. We show that the worst case deterministic state complexity of a radius [Formula: see text] neighbourhood of a language recognized by an [Formula: see text] state nondeterministic finite automaton [Formula: see text] is [Formula: see text]. In the case where [Formula: see text] is deterministic we get the same lower bound for the state complexity of the neighbourhood if we use an additive quasi-distance. The lower bound constructions use an alphabet of size linear in [Formula: see text]. We show that the worst case state complexity of the set of strings that contain a substring within distance [Formula: see text] from a string recognized by [Formula: see text] is [Formula: see text].

Sign in / Sign up

Export Citation Format

Share Document