Rankings
Publications
Search Publications
Cited-by Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Scilit
About Us
Advisory Board
Data Sources
Career
Support / Contact
User Guide
Publisher User
Search Function
Rankings Function
API Resource
Scilit Knowledge
Metrics
Scilit Recognitions
Publications Classification
Media
News
Blog
Login
Register
Home
Publications
Mirror Images and Schemes for the Maximal Complexity of Nondeterminism
Home
Publications
Mirror Images and Schemes for the Maximal Complexity of Nondeterminism
Mirror Images and Schemes for the Maximal Complexity of Nondeterminism
Author:
AS
Arto Salomaa
Arto Salomaa
Article Alert
Citation Alert
Add to Library
Cite
Download
Share
Download
Download PDF
Download
Publisher website
Google Scholar
1 January 2012
journal article
Published by
SAGE Publications
in
Fundamenta Informaticae
Vol. 116
(1-4)
,
237-249
DOI:
10.3233/fi-2012-681
Abstract
We present schemes of deterministic finite automata such that, for every nontrivial automaton A resulting from the scheme with n states, the state complexity of the mirror image of the language L(A) equals 2n . The construction leads to cases, where
Keywords
STATE COMPLEXITY
MIRROR IMAGES
OPEN PROBLEM
NONDETERMINISTIC DEVICE
N STATE
LANGUAGE L
CRUCIAL IMPORTANCE
NONTRIVIAL AUTOMATON
MIRROR IMAGE
PRESENT SCHEME
MAXIMAL COMPLEXITY
CONSTRUCTION
FINITE AUTOMATON
Related articles
Cited
Cited by 1 article
Scroll to top