Descendants of Regular Language in a Class of Rewriting Systems: Algorithm and Complexity of an Automata Construction

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-17220-3_11
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Construction of Tree Automata From Regular Expressions

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

Synchronization of Regular Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Closure of Hedge-Automata Languages by Hedge Rewriting

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

The Complexity of Interacting Automata

International Journal of Game Theory
StatisticsProbabilityUncertaintyEconomicsSocial SciencesMathematicsEconometrics
2015English

Automata in Categories and Regular Languages

Memoirs of the Faculty of Science, Kyushu University. Series A, Mathematics
1984English

An Algorithm for Computing a Normal Form of a Class of Planar Degenerate Dynamical Systems

Advances in Applied Mathematics
2016English

Regularization, Recognition and Complexity Estimation Methods of Automata Models of Discrete Dynamical Systems in Control Problem

American Journal of Management Science and Engineering
2017English

Complexity Analysis of Channel Estimation Algorithm in MIMO-OFDMA Systems

Information Technology Journal
2012English

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

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy