Capabilities of Ultrametric Automata with One, Two, and Three States

DOI10.1007/978-3-662-49192-8_21zbMath1442.68091OpenAlexW2408638341MaRDI QIDQ2794364

Maksims Dimitrijevs

Publication date: 10 March 2016

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

Full work available at URL: https://doi.org/10.1007/978-3-662-49192-8_21

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Uncountable classical and quantum complexity classes

This page was built for publication: Capabilities of Ultrametric Automata with One, Two, and Three States