scientific article
From MaRDI portal
Publication:2762531
zbMath0976.03042MaRDI QIDQ2762531
Publication date: 9 January 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2010/20100539
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)
Related Items (10)
Relating Automata-theoretic Hierarchies to Complexity-theoretic Hierarchies ⋮ Efficient algorithms for membership in Boolean hierarchies of regular languages ⋮ Definability in the structure of words with the inclusion relation ⋮ On the main scientific achievements of Victor Selivanov ⋮ Fine hierarchies via Priestley duality ⋮ Well-Quasi Orders and Hierarchy Theory ⋮ Hierarchies and reducibilities on regular languages related to modulo counting ⋮ Fine hierarchies and m-reducibilities in theoretical computer science ⋮ A reducibility for the dot-depth hierarchy ⋮ A conjecture on the concatenation product
This page was built for publication:
