A New Technique for Reachability of States in Concatenation Automata

Davies, Sylvie

doi:10.1007/978-3-319-94631-3_7

Cited by 2 publications

(1 citation statement)

References 24 publications

(48 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Thus all states of the form {0 ′ , q} for q ∈ Q n are reachable from {0 ′ }, using the set of words {x, xa, xa 2 , • • • , xa n−2 , xc} where x = ba m−1 b. Since all of these words are permutations of Q n except for xc, by [12,Theorem 2] all states of the form {0 ′ } ∪ S with S ⊆ Q n are reachable.…”

Section: Resultsmentioning

confidence: 99%

Most Complex Deterministic Union-Free Regular Languages

Brzozowski

Davies

2018

Descriptional Complexity of Formal Systems

Self Cite

View full text Add to dashboard Cite

A regular language L is union-free if it can be represented by a regular expression without the union operation. A union-free language is deterministic if it can be accepted by a deterministic one-cycle-freepath finite automaton; this is an automaton which has one final state and exactly one cycle-free path from any state to the final state. Jirásková and Masopust proved that the state complexities of the basic operations reversal, star, product, and boolean operations in deterministic unionfree languages are exactly the same as those in the class of all regular languages. To prove that the bounds are met they used five types of automata, involving eight types of transformations of the set of states of the automata. We show that for each n 3 there exists one ternary witness of state complexity n that meets the bound for reversal and product. Moreover, the restrictions of this witness to binary alphabets meet the bounds for star and boolean operations. We also show that the tight upper bounds on the state complexity of binary operations that take arguments over different alphabets are the same as those for arbitrary regular languages. Furthermore, we prove that the maximal syntactic semigroup of a union-free language has n n elements, as in the case of regular languages, and that the maximal state complexities of atoms of union-free languages are the same as those for regular languages. Finally, we prove that there exists a most complex union-free language that meets the bounds for all these complexity measures. Altogether this proves that the complexity measures above cannot distinguish union-free languages from regular languages.

show abstract

Section: Resultsmentioning

confidence: 99%

Most Complex Deterministic Union-Free Regular Languages

Brzozowski

Davies

2018

Descriptional Complexity of Formal Systems

Self Cite

View full text Add to dashboard Cite

show abstract

Most Complex Non-Returning Regular Languages

Brzozowski

Davies

2019

Int. J. Found. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

A regular language L is non-returning if in the minimal deterministic finite automaton accepting it there are no transitions into the initial state. Eom, Han and Jirásková derived upper bounds on the state complexity of boolean operations and Kleene star, and proved that these bounds are tight using two different binary witnesses. They derived upper bounds for concatenation and reversal using three different ternary witnesses. These five witnesses use a total of six different transformations. We show that for each n 4 there exists a ternary witness of state complexity n that meets the bound for reversal and that at least three letters are needed to meet this bound. Moreover, the restrictions of this witness to binary alphabets meet the bounds for product, star, and boolean operations. We also derive tight upper bounds on the state complexity of binary operations that take arguments with different alphabets. We prove that the maximal syntactic semigroup of a non-returning language has (n − 1) n elements and requires at least n 2 generators. We find the maximal state complexities of atoms of non-returning languages. Finally, we show that there exists a most complex non-returning language that meets the bounds for all these complexity measures.

show abstract

A New Technique for Reachability of States in Concatenation Automata

Cited by 2 publications

References 24 publications

Most Complex Deterministic Union-Free Regular Languages

Most Complex Deterministic Union-Free Regular Languages

Most Complex Non-Returning Regular Languages

Contact Info

Product

Resources

About