Below you will find example sentences with "regular languages". The examples show how this phrase is used in natural context and which words often surround it.

Regular Languages in a sentence

Corpus data

  • Displayed example sentences: 8
  • Discovered as a combination around: regular
  • Corpus frequency in the collocation scan: 6
  • Phrase length: 2 words
  • Average sentence length: 23.1 words

Words in this phrase

regular languages

Meanings of words in this phrase

  • regular can mean: Bound by religious rule; belonging to a monastic or religious order (often as opposed to secular). Common word
  • languages can mean: plural of language Frequent word

Sentence profile

  • Phrase position: 3 start, 3 middle, 2 end
  • Sentence types: 8 statements, 0 questions, 0 exclamations

Usage patterns

These patterns show short text windows around the phrase in the example sentences:

are the regular languages a language 1× classes of regular languages can only 1× exactly the regular languages as well 1× not all regular languages can be 1× not true regular languages can also 1× only all regular languages that do 1× only describe regular languages the reverse 1× regular languages are commonly 1×

Sentence openings and endings

Common sentence openings:

by definition the 1× if empty productions 1× luckily there is 1× not all regular 1× regular languages are 1× some classes of 1×

Common sentence endings:

can be generated 1× equivalent regular expressions 1× languages as well 1× non regular grammars 1× of programming languages 1× of regular languages 1×

Context words

These words often appear near this phrase in the example sentences:

grammars 3× size 3× describe 2× described 2× language 2× used 2× expressions 2× finite 2× automata 2× nfas 2× empty 2× reverse 1×

Related phrases

regular season programming languages indigenous languages sign languages official languages romance languages european languages regular basis formal languages

Phrases around this combination

Other phrases discovered around regular:

regular season 20× regular basis 10×

Just before it in the phrase index:

regular basis registration process registration exercise registered voters registered republicans registered nurses

Just after it in the phrase index:

regular season regularly scheduled regularly used regulatory agency regulatory approval regulatory authority

Other phrases with the same pattern

Same start:

regular season regular basis

Same ending:

programming languages indigenous languages sign languages official languages romance languages european languages

Corpus analysis

  • The phrase "regular languages" has 2 words and usually appears near the start in these examples. The average sentence has 23.1 words and is mostly made up of statements.
  • Around this phrase, patterns and context words such as are the regular languages a language, classes of regular languages can only, grammars, size and describe stand out.
  • In the phrase index, this combination connects with regular season, programming languages, indigenous languages, regular season and regular basis, linking the page to nearby combinations.

Example types with regular languages

This selection groups the examples by length and sentence type, making usage of the full phrase easier to scan:

Short example sentences

Regular languages are commonly used to define search patterns and the lexical structure of programming languages. (16 words)

The right regular grammars describe the reverses of all such languages, that is, exactly the regular languages as well. (19 words)

If empty productions are disallowed, only all regular languages that do not include the empty string can be generated. (19 words)

Longer example sentences

Luckily, there is a simple mapping from regular expressions to the more general nondeterministic finite automata (NFAs) that does not lead to such a blowup in size; for this reason NFAs are often used as alternative representations of regular languages. (40 words)

Some classes of regular languages can only be described by deterministic finite automata whose size grows exponentially in the size of the shortest equivalent regular expressions. (26 words)

While regular grammars can only describe regular languages, the reverse is not true: regular languages can also be described by non-regular grammars. (23 words)

Example sentences (8)

While regular grammars can only describe regular languages, the reverse is not true: regular languages can also be described by non-regular grammars.

By definition, the languages accepted by FSMs are the regular languages —; a language is regular if there is some FSM that accepts it.

The right regular grammars describe the reverses of all such languages, that is, exactly the regular languages as well.

Regular languages are commonly used to define search patterns and the lexical structure of programming languages.

Luckily, there is a simple mapping from regular expressions to the more general nondeterministic finite automata (NFAs) that does not lead to such a blowup in size; for this reason NFAs are often used as alternative representations of regular languages.

Some classes of regular languages can only be described by deterministic finite automata whose size grows exponentially in the size of the shortest equivalent regular expressions.

If empty productions are disallowed, only all regular languages that do not include the empty string can be generated.

Not all regular languages can be induced in this way (see language identification in the limit ), but many can.