Skip to search formSkip to main contentSkip to account menu

Star-free language

Known as: Star-free regular language 
A regular language is said to be star-free if it can be described by a regular expression constructed from the letters of the alphabet, the empty set… 
Wikipedia (opens in a new tab)

Related topics

Related topics

14 relations
AC0Aperiodic finite state automatonConcatenationFO (complexity)

Broader (1)

Logic in computer science

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Synthesis of Quantifier-Free First-Order Sentences from Noisy Samples of Strings
We present a method to extract knowledge in terms of quantifier-free first-order sentences in disjunctive normal form from noisy… 
2018
2018
On Decidable Fragments of dL
Decidable fragments of differential dynamic logic (dL) are of interest to its proof theory, but also to the practice of verifying… 
2017
2017
The Power of Constraint Grammars Revisited
Sequential Constraint Grammar (SCG) (Karlsson, 1990) and its extensions have lacked clear connections to formal language theory… 
2014
2014
Star-free languages and local divisors
A celebrated result of Sch\"utzenberger says that a language is star-free if and only if it is is recognized by a finite… 
2014
2014
On Minimalism of Analysis by Reduction by Restarting Automata
The paper provides linguistic observations as a motivation for a formal study of an analysis by reduction. It concentrates on a… 
2012
2012
Defining star-free regular languages using diagrammatic logic
Spider diagrams are a recently developed visual logic that make statements about relationships between sets, their members and… 
2011
2011
Syntactic Complexity of Star-Free Languages
The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a… 
Review
2009
Review
2009
Wide-field spectroscopic observations of comet C/2004 Q2 (Machholz) by GALEX
Comet C/2004 Q2 (Machholz) was observed by the Galaxy Evolution Explorer (GALEX), UT 2005 March 1. The GALEX satellite, a NASA… 
2008
2008
Spider Diagrams of Order and a Hierarchy of Star-Free Regular Languages
The spider diagram logic forms a fragment of the constraint diagram logic and was designed to be primarily used as a diagrammatic… 
1999
1999
SGML & XML Content Models
The SGML and XML standards use a variation of regular expressions called content models for modeling the markup structures of… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)