Keyword

closure properties

Description: Properties describing whether a formal language or family of languages remains in the same class after specified operations.

Primary topic: semigroups and automata theory (50%)

OpenAlex ID: keywords/closure-properties

A theory of timed automata

1994 · Rajeev Alur, David L. Dill · Theoretical Computer Science · 6,493

Mixtures of Dirichlet Processes with Applications to Bayesian Nonparametric Problems

1974 · Charles E. Antoniak · The Annals of Statistics · 1,975

PDF

Learnability and the Vapnik-Chervonenkis dimension

1989 · Anselm Blumer, A. Ehrenfeucht, et al. · Journal of the ACM · 1,821

PDF

Formal Languages and Their Relation to Automata

1969 · John E. Hopcroft, Jeffrey D. Ullman · CERN Document Server (European Organization for Nuclear Research) · 1,360

Automata for modeling real-time systems

2005 · Rajeev Alur, David Dill · Springer eBooks · 904

A new family of life distributions

1969 · Z.W. Birnbaum, S.C. Saunders · Journal of Applied Probability · 823

Nondeterministic Space is Closed under Complementation

1988 · Neil Immerman · SIAM Journal on Computing · 651

Visibly pushdown languages

2004 · Rajeev Alur, P. Madhusudan · ACM Symposium on Theory of Computing (STOC) · 568

PDF

Univariate statistical analysis of environmental (compositional) data: Problems and possibilities

2009 · Peter Filzmoser, Karel Hron, et al. · The Science of The Total Environment · 448

Indexed Grammars—An Extension of Context-Free Grammars

1968 · Alfred V. Aho · Journal of the ACM · 434

PDF

Quantum automata and quantum grammars

2000 · Cristopher Moore, James P. Crutchfield · Theoretical Computer Science · 407

PDF

On multiple context-free grammars

1991 · Hiroyuki Seki, Takashi Matsumura, et al. · Theoretical Computer Science · 392

Finite-memory automata

1994 · Michael Kaminski, Nissim Francez · Theoretical Computer Science · 373

PDF

Beyond Market Baskets: Generalizing Association Rules to Dependence Rules

1998 · Craig Silverstein, Sergey Brin, et al. · Data Mining and Knowledge Discovery · 368

Working Models for Uncertain Data

2006 · A.D. Sarma, O. Benjelloun, et al. · Proceedings - International Conference on Data Engineering · 344

Adding nesting structure to words

2009 · Rajeev Alur, P. Madhusudan · Journal of the ACM · 334

Composite Media and Asymptotic Dirichlet Forms

1994 · U. Mosco · Journal of Functional Analysis · 326

The ASPIC + framework for structured argumentation: a tutorial

2014 · Sanjay Modgil, Henry Prakken · Argument & Computation · 325

PDF

A general theory of composition for trace sets closed under selective interleaving functions

2002 · J. McLean · 324

On Relations Defined by Generalized Finite Automata

1965 · C. C. Elgot, J. E. Mezei · IBM Journal of Research and Development · 319

Automata on Infinite Objects and Church’s Problem

1972 · Michael Rabin · Regional conference series in mathematics · 295

Automatic structures

2002 · A. Blumensath, E. Gradel · 292

Theory of computation

1986 · Derick Wood · Medical Entomology and Zoology · 277

The theory of timed automata

1992 · Rajeev Alur, David Dill · Lecture notes in computer science · 271

Deterministic context free languages

1966 · Seymour Ginsburg, Sheila Greibach · Information and Control · 248

Works count: 3,288

Citation count: 50,180