Skip to search formSkip to main contentSkip to account menu

Regular language

Known as: Rational language, Regular Languages, Cyclic language 
In theoretical computer science and formal language theory, a regular language (also called a rational language) is a formal language that can be… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
We say that a triangle $$T$$T tiles the polygon $$\mathcal A $$A if $$\mathcal A $$A can be decomposed into finitely many non… 
2013
2013
We are interested in monoids and its applications. If every element x in a monoid has a quasi-inverse y in the sense of von… 
2007
2007
Systems consisting of several components that communicate via unbounded perfect FIFO channels (i.e. FIFO systems) arise naturally… 
2005
2005
Despite significant advances in the development of model checking, it remains a difficult task in the hands of experts to make it… 
2001
2001
A content analysis of the debate in the printed media around Afrikaans, April 1994 to 1996 Section A : language-as-problem and… 
1999
1998
1998
For every string inclusion relation there are two optimization problems: find a longest string included in every string of a… 
1989
1989
D.E. Rumelhart et al.'s proposal (1986) of how symbolic processing is achieved in PDP (parallel distributed processing) networks… 
1981
1981
Abstract : This paper introduces a new programmable building-block for recognition of regular languages. By combining three types… 
1953
1953
If a matrix A transforms a sequence { zn } into the sequence { n} i.e., if On= D-1 an,kZkg and if n->z as n-> oo whenever zn--z…