On the size complexity of deterministic frequency automata

Rūsiņš Mārtiņš Freivalds; Thomas Zeugmann; Grant R. Pogosyan

On the size complexity of deterministic frequency automata

Rūsiņš Mārtiņš Freivalds
, Thomas Zeugmann
, Grant R. Pogosyan

University of Latvia

University of Latvia
Hokkaido University
International Christian University

Research output: Chapter in Book/Report/Conference proceeding › Conference paper › Research › peer-review

2 Citations (Scopus)

Original language	English
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Place of Publication	Heidelberg
Publisher	Springer-Verlag
Pages	287-298
Volume	7810 LNCS
ISBN (Print)	9783642370632
Publication status	Published - 2013

Publication series

Name	Lecture Notes in Computer Science ; Vol.7810

OECD Field of Science

1.3 Physical Sciences

Cite this

Freivalds, Rūsiņš Mārtiņš ; Zeugmann, Thomas ; Pogosyan, Grant R. / On the size complexity of deterministic frequency automata. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7810 LNCS Heidelberg : Springer-Verlag, 2013. pp. 287-298 (Lecture Notes in Computer Science ; Vol.7810).

@inproceedings{5709d3b6c0a64569a627cdef9d8f2a03,

title = "On the size complexity of deterministic frequency automata",

author = "Freivalds, \{Rūsiņ{\v s} Mārtiņ{\v s}\} and Thomas Zeugmann and Pogosyan, \{Grant R.\}",

year = "2013",

language = "English",

isbn = "9783642370632",

volume = "7810 LNCS",

series = "Lecture Notes in Computer Science ; Vol.7810",

publisher = "Springer-Verlag",

pages = "287--298",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

On the size complexity of deterministic frequency automata. / Freivalds, Rūsiņš Mārtiņš; Zeugmann, Thomas; Pogosyan, Grant R.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7810 LNCS Heidelberg: Springer-Verlag, 2013. p. 287-298 (Lecture Notes in Computer Science ; Vol.7810).

Research output: Chapter in Book/Report/Conference proceeding › Conference paper › Research › peer-review

TY - GEN

T1 - On the size complexity of deterministic frequency automata

AU - Freivalds, Rūsiņš Mārtiņš

AU - Zeugmann, Thomas

AU - Pogosyan, Grant R.

PY - 2013

Y1 - 2013

UR - https://link.springer.com/chapter/10.1007/978-3-642-37064-9_26

M3 - Conference paper

SN - 9783642370632

VL - 7810 LNCS

T3 - Lecture Notes in Computer Science ; Vol.7810

SP - 287

EP - 298

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer-Verlag

CY - Heidelberg

ER -

On the size complexity of deterministic frequency automata

Publication series

OECD Field of Science

Other files and links

Cite this