Bridoux, Florian; Perrot, Kévin; Marchetto, Aymeric Picard; Richard, Adrien Interaction graphs of isomorphic automata networks. I: Complete digraph and minimum in-degree. (English) Zbl 07730237 J. Comput. Syst. Sci. 138, Article ID 103458, 16 p. (2023). MSC: 68R10 68Q45 PDFBibTeX XMLCite \textit{F. Bridoux} et al., J. Comput. Syst. Sci. 138, Article ID 103458, 16 p. (2023; Zbl 07730237) Full Text: DOI arXiv
Bridoux, Florian; Castillo-Ramirez, Alonso; Gadouleau, Maximilien Complete simulation of automata networks. (English) Zbl 1435.68148 J. Comput. Syst. Sci. 109, 1-21 (2020). MSC: 68Q45 68Q09 68Q10 68Q70 PDFBibTeX XMLCite \textit{F. Bridoux} et al., J. Comput. Syst. Sci. 109, 1--21 (2020; Zbl 1435.68148) Full Text: DOI arXiv Link
Cabessa, Jérémie; Finkel, Olivier Computational capabilities of analog and evolving neural networks over infinite input streams. (English) Zbl 1410.68120 J. Comput. Syst. Sci. 101, 86-99 (2019). MSC: 68Q05 68Q45 92B20 PDFBibTeX XMLCite \textit{J. Cabessa} and \textit{O. Finkel}, J. Comput. Syst. Sci. 101, 86--99 (2019; Zbl 1410.68120) Full Text: DOI HAL
Haar, Stefan; Haddad, Serge; Melliti, Tarek; Schwoon, Stefan Optimal constructions for active diagnosis. (English) Zbl 1350.68052 J. Comput. Syst. Sci. 83, 101-120 (2017). MSC: 68M15 68Q25 68Q45 68Q85 93B50 93C65 PDFBibTeX XMLCite \textit{S. Haar} et al., J. Comput. Syst. Sci. 83, 101--120 (2017; Zbl 1350.68052) Full Text: DOI
Cabessa, Jérémie; Villa, Alessandro E. P. Expressive power of first-order recurrent neural networks determined by their attractor dynamics. (English) Zbl 1351.68097 J. Comput. Syst. Sci. 82, No. 8, 1232-1250 (2016). Reviewer: T. C. Mohan (Chennai) MSC: 68Q05 68Q10 68Q45 68T05 92B20 PDFBibTeX XMLCite \textit{J. Cabessa} and \textit{A. E. P. Villa}, J. Comput. Syst. Sci. 82, No. 8, 1232--1250 (2016; Zbl 1351.68097) Full Text: DOI
Kumar, Neeraj; Iqbal, Rahat; Misra, Sudip; Rodrigues, Joel J. P. C. An intelligent approach for building a secure decentralized public key infrastructure in VANET. (English) Zbl 1329.90032 J. Comput. Syst. Sci. 81, No. 6, 1042-1058 (2015). MSC: 90B20 68Q45 68T05 91A12 91A80 94A60 94A62 PDFBibTeX XMLCite \textit{N. Kumar} et al., J. Comput. Syst. Sci. 81, No. 6, 1042--1058 (2015; Zbl 1329.90032) Full Text: DOI
Thatcher, J. W. Generalized sequential machine maps. (English) Zbl 0198.03303 J. Comput. Syst. Sci. 4, 339-367 (1970). PDFBibTeX XMLCite \textit{J. W. Thatcher}, J. Comput. Syst. Sci. 4, 339--367 (1970; Zbl 0198.03303) Full Text: DOI
Ginsburg, S.; Greibach, S. Principal AFL. (English) Zbl 0198.03102 J. Comput. Syst. Sci. 4, 308-338 (1970). PDFBibTeX XMLCite \textit{S. Ginsburg} and \textit{S. Greibach}, J. Comput. Syst. Sci. 4, 308--338 (1970; Zbl 0198.03102) Full Text: DOI
Hartmanis, J.; Hopcroft, J. E. What makes some language theory problems undecidable. (English) Zbl 0198.03001 J. Comput. Syst. Sci. 4, 368-376 (1970). PDFBibTeX XMLCite \textit{J. Hartmanis} and \textit{J. E. Hopcroft}, J. Comput. Syst. Sci. 4, 368--376 (1970; Zbl 0198.03001) Full Text: DOI
Preparata, F. P.; Muller, D. E. Generation of near-optimal universal Boolean functions. (English) Zbl 0191.31201 J. Comput. Syst. Sci. 4, 93-102 (1970). PDFBibTeX XMLCite \textit{F. P. Preparata} and \textit{D. E. Muller}, J. Comput. Syst. Sci. 4, 93--102 (1970; Zbl 0191.31201) Full Text: DOI
Yamada, H.; Amoroso, S. A completeness problem for pattern generation in tessellation automata. (English) Zbl 0191.31006 J. Comput. Syst. Sci. 4, 137-176 (1970). PDFBibTeX XMLCite \textit{H. Yamada} and \textit{S. Amoroso}, J. Comput. Syst. Sci. 4, 137--176 (1970; Zbl 0191.31006) Full Text: DOI
Savitch, W. J. Relationships between nondeterministic and deterministic tape complexities. (English) Zbl 0188.33502 J. Comput. Syst. Sci. 4, 177-192 (1970). PDFBibTeX XMLCite \textit{W. J. Savitch}, J. Comput. Syst. Sci. 4, 177--192 (1970; Zbl 0188.33502) Full Text: DOI
Mager, G. Writing pushdown acceptors. (English) Zbl 0198.03104 J. Comput. Syst. Sci. 3, 276-318 (1969). PDFBibTeX XMLCite \textit{G. Mager}, J. Comput. Syst. Sci. 3, 276--318 (1969; Zbl 0198.03104) Full Text: DOI
Deuel, D. R. Time-varying linear sequential machines. I. (English) Zbl 0193.33202 J. Comput. Syst. Sci. 3, 93-118 (1969). PDFBibTeX XMLCite \textit{D. R. Deuel}, J. Comput. Syst. Sci. 3, 93--118 (1969; Zbl 0193.33202) Full Text: DOI
Baer, Robert M.; Spanier, Edwin H. Referenced automata and metaregular families. (English) Zbl 0183.29601 J. Comput. Syst. Sci. 3, 423-446 (1969). PDFBibTeX XMLCite \textit{R. M. Baer} and \textit{E. H. Spanier}, J. Comput. Syst. Sci. 3, 423--446 (1969; Zbl 0183.29601) Full Text: DOI
Mizumoto, M.; Toyoda, J.; Tanaka, Kohkichi Some considerations on Fuzzy automata. (English) Zbl 0183.29501 J. Comput. Syst. Sci. 3, 409-422 (1969). PDFBibTeX XMLCite \textit{M. Mizumoto} et al., J. Comput. Syst. Sci. 3, 409--422 (1969; Zbl 0183.29501) Full Text: DOI
Blum, E. K. Towards a theory of semantics and compilers for programming languages. (English) Zbl 0174.28903 J. Comput. Syst. Sci. 3, 248-275 (1969). PDFBibTeX XMLCite \textit{E. K. Blum}, J. Comput. Syst. Sci. 3, 248--275 (1969; Zbl 0174.28903) Full Text: DOI
Aho, A. V.; Ullman, J. D. Properties of syntax directed translations. (English) Zbl 0174.02802 J. Comput. Syst. Sci. 3, 319-334 (1969). PDFBibTeX XMLCite \textit{A. V. Aho} and \textit{J. D. Ullman}, J. Comput. Syst. Sci. 3, 319--334 (1969; Zbl 0174.02802) Full Text: DOI
Greibach, S.; Hopcroft, J. Scattered context grammars. (English) Zbl 0174.02801 J. Comput. Syst. Sci. 3, 233-247 (1969). PDFBibTeX XMLCite \textit{S. Greibach} and \textit{J. Hopcroft}, J. Comput. Syst. Sci. 3, 233--247 (1969; Zbl 0174.02801) Full Text: DOI
Greibach, S. Checking automata and one-way stack languages. (English) Zbl 0174.02702 J. Comput. Syst. Sci. 3, 196-217 (1969). PDFBibTeX XMLCite \textit{S. Greibach}, J. Comput. Syst. Sci. 3, 196--217 (1969; Zbl 0174.02702) Full Text: DOI
Gallaire, H.; Gray, J. N.; Harrison, M. A.; Herman, G. T. Infinite linear sequential machines. (English) Zbl 0184.02703 J. Comput. Syst. Sci. 2, 381-419 (1968). PDFBibTeX XMLCite \textit{H. Gallaire} et al., J. Comput. Syst. Sci. 2, 381--419 (1968; Zbl 0184.02703) Full Text: DOI
Paull, M. C.; Unger, S. H. Structural equivalence of context-free grammars. (English) Zbl 0179.02301 J. Comput. Syst. Sci. 2, 427-463 (1968). PDFBibTeX XMLCite \textit{M. C. Paull} and \textit{S. H. Unger}, J. Comput. Syst. Sci. 2, 427--463 (1968; Zbl 0179.02301) Full Text: DOI
Allen, D. jun. On a characterization of the nonregular set of primes. (English) Zbl 0177.01903 J. Comput. Syst. Sci. 2, 464-467 (1968). PDFBibTeX XMLCite \textit{D. Allen jun.}, J. Comput. Syst. Sci. 2, 464--467 (1968; Zbl 0177.01903) Full Text: DOI
Hopcroft, J. E.; Ullman, J. D. Deterministic stack automata and the quotient operator. (English) Zbl 0169.31303 J. Comput. Syst. Sci. 2, 1-12 (1968). PDFBibTeX XMLCite \textit{J. E. Hopcroft} and \textit{J. D. Ullman}, J. Comput. Syst. Sci. 2, 1--12 (1968; Zbl 0169.31303) Full Text: DOI
Hartmanis, Juris; Davis, Wayne A. Homomorphic images of linear sequential machines. (English) Zbl 0174.03404 J. Comput. Syst. Sci. 1, 155-165 (1967). PDFBibTeX XMLCite \textit{J. Hartmanis} and \textit{W. A. Davis}, J. Comput. Syst. Sci. 1, 155--165 (1967; Zbl 0174.03404) Full Text: DOI
Hopcroft, J. E.; Ullman, J. D. Nonerasing stack automata. (English) Zbl 0166.00506 J. Comput. Syst. Sci. 1, 166-186 (1967). PDFBibTeX XMLCite \textit{J. E. Hopcroft} and \textit{J. D. Ullman}, J. Comput. Syst. Sci. 1, 166--186 (1967; Zbl 0166.00506) Full Text: DOI
Scott, D. Some definitional suggestions for automata theory. (English) Zbl 0164.32103 J. Comput. Syst. Sci. 1, 187-212 (1967). PDFBibTeX XMLCite \textit{D. Scott}, J. Comput. Syst. Sci. 1, 187--212 (1967; Zbl 0164.32103) Full Text: DOI