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
27 Jul 1996
TL;DR: This work introduces a new syntactic explanation of type expressions as functors as well as a simple logic for programs with recursive types in which they carry out their proofs.
Abstract: We study recursive types from a syntactic perspective. In particular, we compare the formulations of recursive types that are used in programming languages and formal systems. Our main tool is a new syntactic explanation of type expressions as functors. We also introduce a simple logic for programs with recursive types in which we carry out our proofs.
58 citations
01 Dec 1982
TL;DR: The concept of a controllable language is defined and necessary and sufficient conditions for the existence of a supervisor to achieve a given controlled behavior are derived.
Abstract: A discrete event process is modelled as a discrete state dynamic system which generates as output a formal language over the alphabet ?. The objective of supervision is to ensure that this output language has certain desired properties. We define the concept of a controllable language and derive necessary and sufficient conditions for the existence of a supervisor to achieve a given controlled behavior. We also show that every supervisor contains an internal model of the resulting supervised behavior.
58 citations
TL;DR: A direct and constructive proof is given that every regular language is the homomorphic image of a splicing language as defined by Head.
Abstract: A direct and constructive proof is given that every regular language is the homomorphic image of a splicing language as defined by Head. The class of splicing languages involved have a particularly simple presentation and are regular. Also presented are some examples which demonstrate the relation of the class of splicing languages to that of regular languages and an example of a regular language which is not a splicing language.
58 citations
06 Mar 2017
TL;DR: An algorithm that learns the class of Tier-based Strictly k-Local (TSL\(_k\)) formal languages in polynomial time on a sample of positive data whose size is bounded by a constant is introduced.
Abstract: We introduce an algorithm that learns the class of Tier-based Strictly k-Local (TSL\(_k\)) formal languages in polynomial time on a sample of positive data whose size is bounded by a constant. The TSL\(_k\) languages are useful in modeling the cognition of sound patterns in natural language [6, 11], and it is known that they can be efficiently learned from positive data in the case that \(k=2\) [9]. We extend this result to any k and improve on its time efficiency. We also refine the definition of a canonical TSL\(_k\) grammar and prove several properties about these grammars that aid in their learning.
58 citations
21 Jun 1998
TL;DR: It is proved that bisimulation is a congruence for any language defined in promoted tyft/tyxt format and the usefulness of the rule format is demonstrated by presenting promoted tyf-tyxt definitions for the lazy /spl lambda/-calculus, CHOCS and the /spl pi/calculus.
Abstract: In this paper we describe the promoted tyft/tyxt rule format for defining higher-order languages. The rule format is a generalization of Groote and Vaandrager's tyft/tyxt format in which terms are allowed as labels on transitions in rules. We prove that bisimulation is a congruence for any language defined in promoted tyft/tyxt format and demonstrate the usefulness of the rule format by presenting promoted tyft/tyxt definitions for the lazy /spl lambda/-calculus, CHOCS and the /spl pi/-calculus.
58 citations