scientific article; zbMATH DE number 1929936

MaRDI QIDQ4708568zbMATH OpenFDO

Authors Didier Caucal, Teodor Knapik

Publication date 18 June 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2420/24200177.htm

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 4152360
• On the structure of graphs in the Caucal hierarchy
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• A normal form problem for unlabeled boundary NLC graph languages
• On infinite transition graphs having a decidable monadic theory

Cited in

(4)

• 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
• Linearly bounded infinite graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4708568)