Topic
Formal language
About: Formal language is a research topic. Over the lifetime, 5763 publications have been published within this topic receiving 154114 citations.
Papers published on a yearly basis
Papers
More filters
TL;DR: Power properties of this parsable subclass of NLC grammars are investigated and a discussion concerning a problem of constructing graph languages with a polynomial membership problem is discussed.
47 citations
01 Jan 1980
TL;DR: In this article, the authors present a list of open problems concerning regular languages and finite automata, including the star height problem, which has been studied extensively in theoretical computer science.
Abstract: Publisher Summary The theory of regular languages and finite automata was developed in the early 1950s and is one of the oldest branches of theoretical computer science. Regular languages constitute the best known family of formal languages, and finite automata constitute the best known family of abstract machine models. The concepts of regular languages and finite automata appear frequently in theoretical computer science and have several important applications. There is a vast literature on these subjects. Despite the fact that many researchers have worked in this field, there remain several difficult open problems. The chapter discusses six of these problems. These problems are of fundamental importance and considerable difficulty. Most of them are intimately involved with the fundamental property of finite automata, namely finiteness. In a monograph published in 1971, McNaughton and Papert included a collection of open problems concerning regular languages. Their list is headed by the star height problem and until now, no progress has been made on such an intriguing question. The bounds on star height apply only to languages whose syntactic monoids are groups. In that case, the corresponding semiautomata are permutation semiautomata.
47 citations
01 Jan 2006
47 citations
TL;DR: A progress report on how researchers in the rewriting logic semantics project are narrowing the gap between theory and practice in areas such as: modular semantic definitions of languages; scalability to real languages; support for real time; semantics of software and hardware modeling languages; and semantics-based analysis tools such as static analyzers, model checkers, and program provers.
Abstract: Rewriting logic is an executable logical framework well suited for the semantic definition of languages. Any such framework has to be judged by its effectiveness to bridge the existing gap between language definitions on the one hand, and language implementations and language analysis tools on the other. We give a progress report on how researchers in the rewriting logic semantics project are narrowing the gap between theory and practice in areas such as: modular semantic definitions of languages; scalability to real languages; support for real time; semantics of software and hardware modeling languages; and semantics-based analysis tools such as static analyzers, model checkers, and program provers.
47 citations