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 (18)

Journals (0)

1-10 of 18 results for deterministic context-free languages

Sort by:

Relevance

Select all

Select all

Sort by:

Relevance

Select article: Some remarks on deterministic Mazurkiewicz algorithms and languages associated with them

Retricted access

Research article

First published 1980

Some remarks on deterministic Mazurkiewicz algorithms and languages associated with them

Ryszard Janicki

Fundamenta Informaticae

Select article: Limited Automata and Context-Free Languages

Retricted access

Research article

First published 2015-1

Limited Automata and Context-Free Languages

Giovanni Pighizzini, Andrea Pisoni

Fundamenta Informaticae

Select article: Iteration Theorems for Deterministic Families of Languages

Retricted access

Research article

First published 1986

Iteration Theorems for Deterministic Families of Languages

Michael A. Harrison

Fundamenta Informaticae

Select article: Some Grammatical Structures of Programming Languages as Simple Bracketed Languages

Free access

Research article

First published 2000-11

Some Grammatical Structures of Programming Languages as Simple Bracketed Languages

Boris Melnikov, Elena Kashlakova

Informatica: An International Journal of Computing and Informatics

Select article: On McNaughton Families of Languages That Are Specified by Some Variants of Monadic String-Rewriting Systems

Retricted access

Research article

First published 2011-10

On McNaughton Families of Languages That Are Specified by Some Variants of Monadic String-Rewriting Systems

Peter Leupold, Friedrich Otto

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: CHOMSKY HIERARCHY AND SYSTOLIC Y-TREE AUTOMATA

Retricted access

Research article

First published 1997-3

CHOMSKY HIERARCHY AND SYSTOLIC Y-TREE AUTOMATA

Emanuela Fachini, Angelo Monti

Fundamenta Informaticae

Select article: On Winning Conditions of High Borel Complexity in Pushdown Games

Retricted access

Research article

First published 2005-6

On Winning Conditions of High Borel Complexity in Pushdown Games

Olivier Finkel

Fundamenta Informaticae

Select article: On Networks of Evolutionary Processors with Filters Accepted by Two-State-Automata

Retricted access

Research article

First published 2011-10

On Networks of Evolutionary Processors with Filters Accepted by Two-State-Automata

Jürgen Dassow, Bianca Truthe

Fundamenta Informaticae

Select article: Reversible Limited Automata

Retricted access

Research article

First published 2017

Reversible Limited Automata

Martin Kutrib, Matthias Wendlandt

Fundamenta Informaticae

1
2
10 / page

Article type

Publication date

Subjects

Access