Syntactic Complexity of Prefix-, Suffix-, and Bifix-Free Regular Languages

2011 ◽  
pp. 93-106 ◽  
Author(s):  
Janusz Brzozowski ◽  
Baiyu Li ◽  
Yuli Ye
Keyword(s):  
Regular Languages ◽  
Syntactic Complexity

Syntactic complexity of bifix-free regular languages

2019 ◽  
Vol 787 ◽  
pp. 45-76 ◽  
Author(s):  
Marek Szykuła ◽  
John Wittnebel
Keyword(s):  
Regular Languages ◽  
Syntactic Complexity

scholarly journals Nondeterministic Syntactic Complexity

2021 ◽  
pp. 448-468
Author(s):  
Robert S. R. Myers ◽  
Stefan Milius ◽  
Henning Urbat
Keyword(s):  
Finite Automata ◽  
Regular Languages ◽  
Syntactic Complexity ◽  
Deterministic Finite Automata ◽  
Syntactic Monoid ◽  
Nondeterministic Finite Automata ◽  
Structural Work ◽  
Algebraic Interpretation ◽  
Nondeterministic State

AbstractWe introduce a new measure on regular languages: their nondeterministic syntactic complexity. It is the least degree of any extension of the ‘canonical boolean representation’ of the syntactic monoid. Equivalently, it is the least number of states of any subatomic nondeterministic acceptor. It turns out that essentially all previous structural work on nondeterministic state-minimality computes this measure. Our approach rests on an algebraic interpretation of nondeterministic finite automata as deterministic finite automata endowed with semilattice structure. Crucially, the latter form a self-dual category.

scholarly journals SYNTACTIC COMPLEXITY OF ℛ- AND 𝒥-TRIVIAL REGULAR LANGUAGES

2014 ◽  
Vol 25 (07) ◽  
pp. 807-821 ◽  
Author(s):  
JANUSZ BRZOZOWSKI ◽  
BAIYU LI
Keyword(s):  
Upper Bounds ◽  
The State ◽  
Regular Languages ◽  
Syntactic Complexity ◽  
State Complexity

The syntactic complexity of a subclass of the class of regular languages is the maximal cardinality of syntactic semigroups of languages in that class, taken as a function of the state complexity n of these languages. We prove that n! and ⌊e(n − 1)⌋. are tight upper bounds for the syntactic complexity of ℛ- and 𝒥-trivial regular languages, respectively.

Eliciting Verbs From Children With Specific Language Impairment

1996 ◽  
Vol 5 (4) ◽  
pp. 17-30 ◽  
Author(s):  
Diane Frome Loeb ◽  
Clifton Pye ◽  
Sean Redmond ◽  
Lori Zobel Richardson
Keyword(s):  
Young Children ◽  
Language Impairment ◽  
Specific Language Impairment ◽  
Syntactic Complexity ◽  
Specific Language ◽  
Lexical Skills

The focus of assessment and intervention is often aimed at increasing the lexical skills of young children with language impairment. Frequently, the use of nouns is the center of the lexical assessment. As a result, the production of verbs is not fully evaluated or integrated into treatment in a way that accounts for their semantic and syntactic complexity. This paper presents a probe for eliciting verbs from children, describes its effectiveness, and discusses the utility of and problems associated with developing such a probe.

Learning Regular Languages from Positive Evidence

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

Export Citation Format

Share Document