Work

Tight bounds on the complexity of cascaded decomposition of automata

Year: 2002

Type: conference-paper

Source: Annual Symposium on Foundations of Computer Science

DOI: 10.1109/fscs.1990.89589

Authors: O. Maler, A. Pnueli

Institutions: Institut national de recherche en sciences et technologies du numérique, Institut de Recherche en Informatique et Systèmes Aléatoires, Centre Inria de l'Université de Rennes, Weizmann Institute of Science

Language: English

Topic: semigroups and automata theory

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W2187379055

FWCI: 1.417

Cites: 21

Cited by: 30

Related to: 10