Describing Periodicity in Two-Way Deterministic Finite Automata Using Transformation Semigroups

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-22321-1_28
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Deterministic Finite Automata

Algebra and Discrete Mathematics
2012English

The Finite Graph Problem for Two-Way Alternating Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2001English

On the Inner Automorphisms of Finite Transformation Semigroups

Proceedings of the Edinburgh Mathematical Society
Mathematics
1996English

A Note on One-Way and Two-Way Automata

Theory of Computing Systems
Computational TheoryTheoretical Computer ScienceMathematics
1970English

Pattern Markov Chains: Optimal Markov Chain Embedding Through Deterministic Finite Automata

Journal of Applied Probability
MathematicsStatisticsUncertaintyProbability
2008English

An Effective Lower Bound for Group Complexity of Finite Semigroups and Automata

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
2012English

Reasoning About the Past With Two-Way Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1998English

Parallel Brute-Force Algorithm for Deriving Reset Sequences From Deterministic Incomplete Finite Automata

Turkish Journal of Electrical Engineering and Computer Sciences
Electronic EngineeringElectricalComputer Science
2019English

Learning Finite Automata Using Label Queries

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy