Work

On the Size Complexity of Deterministic Frequency Automata

Year: 2013

Type: conference-paper

Source: Lecture notes in computer science

DOI: 10.1007/978-3-642-37064-9_26

Authors: Rūsiņš Freivalds, Thomas Zeugmann, Grant R. Pogosyan

Institutions: Hokkaido University, UL Institute of Mathematics and Computer Science, University of Latvia, International Christian University

Language: English

Topic: semigroups and automata theory

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W185868636

FWCI: 0.777

Cites: 20

Cited by: 4

Related to: 10