Linear automata and recognizable subsets in free semirings

Conference proceeding

Peer reviewed

Olga Sokratova

Lecture notes in computer science, Vol.2138, pp.420-423

FCT 2001 : fundamentals of computational theory (Riga, 22-24 August 2001)

2001

DOI: 10.1007/3-540-44669-9_47

View Online

Applied sciences

Automata. Abstract machines. Turing machines

Computer science; control theory; systems

Exact sciences and technology

Theoretical computing

Title: Subtitle: Linear automata and recognizable subsets in free semirings
Creators: Olga Sokratova - University of Tartu
Resource Type: Conference proceeding
Publication Details: Lecture notes in computer science, Vol.2138, pp.420-423
Conference: FCT 2001 : fundamentals of computational theory (Riga, 22-24 August 2001)
Publisher: Springer
DOI: 10.1007/3-540-44669-9_47
ISSN: 0302-9743
eISSN: 1611-3349
Language: English
Date published: 2001
Academic Unit: Mathematics
Record Identifier: 9984240861602771

10 Record Views