scientific article; zbMATH DE number 1953272
From MaRDI portal
Publication:4414724
zbMath1026.68085MaRDI QIDQ4414724
Publication date: 27 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2566/25660037.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (3)
Synchronizing finite automata on Eulerian digraphs. ⋮ Synchronizing generalized monotonic automata ⋮ Synchronizing words for real-time deterministic pushdown automata (extended abstract)
This page was built for publication:
