Introduction to the theory of finite automata. Translated from the Russian. Translation edited by J.C. Shepherdson
From MaRDI portal
Publication:2394550
zbMATH Open0128.01401MaRDI QIDQ2394550FDOQ2394550
Authors: N. E. Kobrinskij, B. A. Trakhtenbrot 
Publication date: 1965
Published in: Studies in Logic and the Foundations of Mathematics (Search for Journal in Brave)
Cited In (7)
- Characteristic measures of switching functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- From finite automata toward hybrid systems (Extended abstract)
- Games with Symmetric Incomplete Information and Asymmetric Computational Resources
- Linear Recurrence Relations for Graph Polynomials
- Title not available (Why is that?)
This page was built for publication: Introduction to the theory of finite automata. Translated from the Russian. Translation edited by J.C. Shepherdson
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2394550)
