Group Input Machine

DOI10.1007/978-3-540-95891-8_47MaRDI QIDQ3599100zbMATH OpenOpenAlexFDO

Authors Ruslans Tarasovs, Rūsiņš Freivalds

Publication date 3 February 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-95891-8_47

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Formal Languages and Groups as Memory
• Finite automata over free groups
• Finite-memory automata
• Real-time vector automata
• On a group-matrix type automaton with output

Cites work

• A lower bound for probabilistic algorithms for finite state machines
• A mad day's work: from Grothendieck to Connes and Kontsevich. The evolution of concepts of space and symmetry
• Finite state verifiers I
• scientific article; zbMATH DE number 3146798 (Why is no real title available?)
• scientific article; zbMATH DE number 3765145 (Why is no real title available?)
• scientific article; zbMATH DE number 3305023 (Why is no real title available?)
• scientific article; zbMATH DE number 3316980 (Why is no real title available?)
• Storage Modification Machines

This page was built for publication: Group Input Machine

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3599100)