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

Journals (0)

1-10 of 20 results for K-automaton

Sort by:

Relevance

Select all

Select all

Sort by:

Relevance

Select article: An Efficient Computation of the Equation K-automaton of a Regular K-expression

Retricted access

Research article

First published 2009-1

An Efficient Computation of the Equation K-automaton of a Regular K-expression

Jean-Marc Champarnaud, Faissal Ouardi, Djelloul Ziadi

Fundamenta Informaticae

Select article: K-State automaton burst detection model based on KOS: Emerging trends in cancer field

Retricted access

Research article

First published 2015-2

K-State automaton burst detection model based on KOS: Emerging trends in cancer field

QingQiang Wu, HaiBin Zhang, Jing Lan

Journal of Information Science

Select article: From Glushkov WFAs to \mathbb{K}-Expressions

Retricted access

Research article

First published 2011-4

From Glushkov WFAs to \mathbb{K}-Expressions

Pascal Caron, Marianne Flouret

Fundamenta Informaticae

Select article: Nonhomogeneous Stochastic Automata

Retricted access

Research article

First published 1981

Nonhomogeneous Stochastic Automata

Sławomir Janicki

Fundamenta Informaticae

Select article: Self-stabilisation of Cellular Automata on Tilings

Retricted access

Research article

First published 2022

Self-stabilisation of Cellular Automata on Tilings

Nazim Fatès, Irène Marcovici, Siamak Taati

Fundamenta Informaticae

Select article: It is Undecidable if Two Regular Tree Languages can be Separated by a Deterministic Tree-walking Automaton

Retricted access

Research article

First published 2017-8-9

It is Undecidable if Two Regular Tree Languages can be Separated by a Deterministic Tree-walking Automaton

Mikołaj Bojańczyk

Fundamenta Informaticae

Select article: Shuffle of Words and Araucaria Trees

Retricted access

Research article

First published 2006-12

Shuffle of Words and Araucaria Trees

René Schott, Jean-Claude Spehner

Fundamenta Informaticae

Select article: On One-Way Cellular Automata with a Fixed Number of Cells

Retricted access

Research article

First published 2003-11

On One-Way Cellular Automata with a Fixed Number of Cells

Andreas Malcher

Fundamenta Informaticae

Select article: One-Visit Caterpillar Tree Automata

Retricted access

Research article

First published 2002-10

One-Visit Caterpillar Tree Automata

Alexander Okhotin, Kai Salomaa, Michael Domaratzki

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