scientific article; zbMATH DE number 1929936
From MaRDI portal
Publication:4708568
zbMath1014.68114MaRDI QIDQ4708568
Publication date: 18 June 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2420/24200177.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42)
Related Items (4)
Linearly bounded infinite graphs ⋮ On the transition graphs of Turing machines. ⋮ An Infinite Automaton Characterization of Double Exponential Time ⋮ On the complexity of a family of \(k\)-context-free sequences
This page was built for publication:
