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

Journals (0)

1-10 of 14 results for nondeterministic state complexity

Sort by:

Relevance

Select all

Select all

Sort by:

Relevance

Select article: Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages

Retricted access

Research article

First published 2009-1

Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages

Yo-Sub Han, Kai Salomaa, Derick Wood

Fundamenta Informaticae

Select article: Results on Transforming NFA into DFCA

Retricted access

Research article

First published 2005-1

Results on Transforming NFA into DFCA

Cezar Câmpeanu, Lila Kari, Andrei Păun

Fundamenta Informaticae

Select article: State Complexity of Union and Intersection for Two-way Nondeterministic Finite Automata

Retricted access

Research article

First published 2011-6

State Complexity of Union and Intersection for Two-way Nondeterministic Finite Automata

Michal Kunc, Alexander Okhotin

Fundamenta Informaticae

Select article: Descriptional Complexity of Finite Automata – Selected Highlights

Retricted access

Research article

First published 2024-07-22

Descriptional Complexity of Finite Automata – Selected Highlights

Arto Salomaa, Kai Salomaa, Taylor J. Smith

Fundamenta Informaticae

Select article: Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers *

Retricted access

Research article

First published 2022

Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers *

Martin Kutrib, Andreas Malcher, Carlo Mereghetti [...]

Fundamenta Informaticae

Select article: Mirror Images and Schemes for the Maximal Complexity of Nondeterminism

Retricted access

Research article

First published 2012-7

Mirror Images and Schemes for the Maximal Complexity of Nondeterminism

Arto Salomaa

Fundamenta Informaticae

Select article: Transformations Between Different Models of Unranked Bottom-Up Tree Automata

Retricted access

Research article

First published 2011-6

Transformations Between Different Models of Unranked Bottom-Up Tree Automata

Xiaoxue Piao, Kai Salomaa

Fundamenta Informaticae

Select article: Residual Finite State Automata

Retricted access

Research article

First published 2002-8

Residual Finite State Automata

François Denis, Aurélien Lemay, Alain Terlutte

Fundamenta Informaticae

Select article: Two-Way Finite Automata: Old and Recent Results

Retricted access

Research article

First published 2013-9

Two-Way Finite Automata: Old and Recent Results

Giovanni Pighizzini

Fundamenta Informaticae

Select article: Efficient Construction of Semilinear Representations of Languages Accepted by Unary Nondeterministic Finite Automata

Retricted access

Research article

First published 2013-4

Efficient Construction of Semilinear Representations of Languages Accepted by Unary Nondeterministic Finite Automata

Zdeněk Sawa

Fundamenta Informaticae

1
2
10 / page

Article type

Publication date

Subjects

Access