You are on the new improved site. You can view the old site in view-only mode here until June 27, 2026

Filter Results

Search all journals

Enter search terms…

Advanced search

/

About

About Sage
About Sage Journals
Privacy Policy
Terms of Use
Contact Us
Help

Information for

Authors
Editors
Librarians
Researchers
Reviewers
Frequently asked questions

Copyright © 2026 by Sage Publications.京ICP备09090397号-11

Search results

Search results page

Articles (40)

Journals (0)

1-10 of 40 results for infinite hierarchy

Sort by:

Relevance

Select all

Select all

Sort by:

Relevance

Select article: Infinite Hierarchy of Permutation Languages

Retricted access

Research article

First published 2014-3

Infinite Hierarchy of Permutation Languages

Grzegorz Madejski

Fundamenta Informaticae

Select article: Pushdown Automata Free of Explicit Nondeterminism and an Infinite Hierarchy of Context-free Languages

Retricted access

Research article

First published 2007-12

Pushdown Automata Free of Explicit Nondeterminism and an Infinite Hierarchy of Context-free Languages

Benjamín René Callejas Bedregal

Fundamenta Informaticae

Select article: Highly Undecidable Problems about Recognizability by Tiling Systems

Retricted access

Research article

First published 2009-5

Highly Undecidable Problems about Recognizability by Tiling Systems

Olivier Finkel

Fundamenta Informaticae

Select article: A Copying Theorem for ETOL Languages with Rank

Retricted access

Research article

First published 1981

A Copying Theorem for ETOL Languages with Rank

Grzegorz Rozenberg, Dirk Vermeir

Fundamenta Informaticae

Select article: Towards a rigorous derivation of the cubic NLSE in dimension one

Retricted access

Research article

First published 2004-11

Towards a rigorous derivation of the cubic NLSE in dimension one

Riccardo Adami, Claude Bardos, François Golse [...]

Asymptotic Analysis

Select article: Generalized Polynomial-Time Reducibilities,Degrees and NP-Completeness

Retricted access

Research article

First published 1984

Generalized Polynomial-Time Reducibilities,Degrees and NP-Completeness

Uwe Schöning

Fundamenta Informaticae

Select article: On the Borel Complexity of MSO Definable Sets of Branches

Retricted access

Research article

First published 2010-3

On the Borel Complexity of MSO Definable Sets of Branches

Mikołaj Bojańczyk, Damian Niwiński, Alexander Rabinovich [...]

Fundamenta Informaticae

Select article: The Boolean Closure of Growing Context-Sensitive Languages

Retricted access

Research article

First published 2008-12

The Boolean Closure of Growing Context-Sensitive Languages

Tomasz Jurdziński

Fundamenta Informaticae

Select article: A Note on Pf(k) – Parsable Languages

Retricted access

Research article

First published 1991

A Note on Pf(k) – Parsable Languages

Tudor Balanescu, Marian Gheorghe

Fundamenta Informaticae

Select article: ON USING SEMI-DYCK SETS TO ANALYSE COUPLED-CONTEXT-FREE LANGUAGES

Retricted access

Research article

First published 1997-1

ON USING SEMI-DYCK SETS TO ANALYSE COUPLED-CONTEXT-FREE LANGUAGES

Günter Hotz, Gisela Pitsch

Fundamenta Informaticae

1
2
3
4
10 / page

Article type

Publication date

Subjects

Access