Practical Stutter-Invariance Checks for $$\omega $$ -Regular Languages

2015 ◽  
pp. 84-101 ◽  
Author(s):  
Thibaud Michaud ◽  
Alexandre Duret-Lutz
Keyword(s):  
Regular Languages

Learning Regular Languages from Positive Evidence

1998 ◽  
Author(s):  
Laura Firoiu ◽  
Tim Oates ◽  
Paul R. Cohen
Keyword(s):  
Regular Languages ◽  
Positive Evidence

Regular languages under F-gsm mappings

1987 ◽  
Vol 18 (3) ◽  
pp. 41-45
Author(s):  
A J Dos Reis
Keyword(s):  
Regular Languages

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

On Sub Regular OL Forms

1981 ◽  
Vol 4 (1) ◽  
pp. 135-149
Author(s):  
J. Albert ◽  
H.A. Maurer ◽  
Th. Ottmann
Keyword(s):  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Regular Languages ◽  
Regularity Problem ◽  
Necessary And Sufficient

We present necessary and sufficient conditions for an OL form F to generate regular languages only. The conditions at issue can be effectively checked, whence the “regularity problem for OL forms” is proven decidable.

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.

Fuzzy regular languages over finite and infinite words

2006 ◽  
Vol 157 (11) ◽  
pp. 1532-1549 ◽  
Author(s):  
Werner Kuich ◽  
George Rahonis
Keyword(s):  
Regular Languages ◽  
Infinite Words

scholarly journals Caterpillar Dualities and Regular Languages

2013 ◽  
Vol 27 (3) ◽  
pp. 1287-1294
Author(s):  
Péter L. Erdös ◽  
Claude Tardif ◽  
Gábor Tardos
Keyword(s):  
Regular Languages

scholarly journals Odometers on Regular Languages

2005 ◽  
Vol 40 (1) ◽  
pp. 1-31 ◽  
Author(s):  
Valérie Berthé ◽  
Michel Rigo
Keyword(s):  
Regular Languages

RESTRICTED SETS OF TRAJECTORIES AND DECIDABILITY OF SHUFFLE DECOMPOSITIONS

2005 ◽  
Vol 16 (05) ◽  
pp. 897-912 ◽  
Author(s):  
MICHAEL DOMARATZKI ◽  
KAI SALOMAA
Keyword(s):  
Regular Languages ◽  
Decomposition Problem ◽  
Open Question ◽  
Free Set ◽  
Context Free ◽  
Undecidability Result

The decidability of the shuffle decomposition problem for regular languages is a long standing open question. We consider decompositions of regular languages with respect to shuffle along a regular set of trajectories and obtain positive decidability results for restricted classes of trajectories. Also we consider decompositions of unary regular languages. Finally, we establish in the spirit of the Dassow-Hinz undecidability result an undecidability result for regular languages shuffled along a fixed linear context-free set of trajectories.

Sign in / Sign up

Export Citation Format

Share Document