Journal of the ACM (JACM)
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
A Family of NFA's Which Need 2n -alpha Deterministic States
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
From Bidirectionality to Alternation
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Note on Minimal Finite Automata
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Applications of Finite Automata
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Two-Way Finite State Transducers with Nested Pebbles
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
The Delta Operation: From Strings to Trees to Strings
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
The Many Faces of a Translation
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Determinization of Glushkov Automata
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
Learning Unary Output Two-Tape Automata from Multiplicity and Equivalence Queries
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
The Equivalence Problem for Computational Models: Decidable and Undecidable Cases
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Noninterference Equations for Nondeterministic Systems
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
On Information and Knowledge Representation in the Brain
ICCI '03 Proceedings of the 2nd IEEE International Conference on Cognitive Informatics
Equivalence in automata theory based on complete residuated lattice-valued logic
Fuzzy Sets and Systems
Comparing the size of NFAs with and without ε-transitions
Theoretical Computer Science
Magic numbers in the state hierarchy of finite automata
Information and Computation
Hybrid one-dimensional reversible cellular automata are regular
Discrete Applied Mathematics
IEEE Transactions on Computers
Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
IEEE Transactions on Computers
A Two-Way Automaton with Fewer States than Any Equivalent One-Way Automaton
IEEE Transactions on Computers
An Improved Upper Bound for the Finite Delay of Graphs
IEEE Transactions on Computers
Regular Events in Stochastic Sequential Machines
IEEE Transactions on Computers
A Class of Push-Down Acceptors for Adjunct Languages
IEEE Transactions on Computers
Relationships Among Distinct Models and Notions of Equivalence for Stochastic Finite-State Systems
IEEE Transactions on Computers
R69-17 On Finite Automata with a Time-Variant Structure
IEEE Transactions on Computers
On the State Minimization of Nondeterministic Finite Automata
IEEE Transactions on Computers
Structural Preserving Morphisms of Finite Automata and an Application to Graph Isomorphism
IEEE Transactions on Computers
Journal of Systems and Software
Decidability and syntactic control of interference
Theoretical Computer Science
Verification Technology Transfer
25 Years of Model Checking
Nondeterministic Finite Automata--Recent Results on the Descriptional and Computational Complexity
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Deterministic Input-Reversal and Input-Revolving Finite Automata
Language and Automata Theory and Applications
More Concise Representation of Regular Languages by Automata and Regular Expressions
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
On the State Complexity of Operations on Two-Way Finite Automata
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
The equivalence problem of multidimensional multitape automata
Journal of Computer and System Sciences
From Philosophical to Industrial Logics
ICLA '09 Proceedings of the 3rd Indian Conference on Logic and Its Applications
On Stateless Deterministic Restarting Automata
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Tighter Bounds for the Determinisation of Büchi Automata
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Descriptional and Computational Complexity of Finite Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Converting Self-verifying Automata into Deterministic Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
The "equal last letter" predicate for words on infinite alphabets and classes of multitape automata
Theoretical Computer Science
Theoretical Computer Science
Determination of finite automata accepting subregular languages
Theoretical Computer Science
An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Compact Normal Form for Regular Languages as Xor Automata
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Concatenation of Regular Languages and Descriptional Complexity
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
On input-revolving deterministic and nondeterministic finite automata
Information and Computation
On relations defined by generalized finite automata
IBM Journal of Research and Development
Programming with angelic nondeterminism
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The state complexity of L2 and Lk
Information Processing Letters
Information Sciences: an International Journal
Substitution in families of languages
Information Sciences: an International Journal
Program schemata as automata. I
Journal of Computer and System Sciences
Ambiguity and decision problems for local adjunct languages
Journal of Computer and System Sciences
Classes of discrete optimization problems and their decision problems
Journal of Computer and System Sciences
Theories of automata on ω-tapes: A simplified approach
Journal of Computer and System Sciences
The equivalence of stack-counter acceptors and quasi-realtime stack-counter acceptors
Journal of Computer and System Sciences
Regular expressions and the equivalence of programs
Journal of Computer and System Sciences
Referenced automata and metaregular families
Journal of Computer and System Sciences
Abstract families of relations
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Classification of noncounting events
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Equivalences on program schemes
Journal of Computer and System Sciences
On formalised computer programs
Journal of Computer and System Sciences
Program schemes, recursion schemes, and formal languages
Journal of Computer and System Sciences
The equivalence problem for deterministic two-tape automata
Journal of Computer and System Sciences
On the structure of abelian automata
Journal of Computer and System Sciences
Tree acceptors and some of their applications
Journal of Computer and System Sciences
A characterization of automata and a direct product decomposition
Journal of Computer and System Sciences
On a characterization of the nonregular set of primes
Journal of Computer and System Sciences
Some definitional suggestions for automata theory
Journal of Computer and System Sciences
Multitape one-way nonwriting automata
Journal of Computer and System Sciences
AFL with the semilinear property
Journal of Computer and System Sciences
Syntactic operators on full semiAFLs
Journal of Computer and System Sciences
The many faces of a translation
Journal of Computer and System Sciences
More concise representation of regular languages by automata and regular expressions
Information and Computation
Myhill--Nerode type theory for fuzzy languages and automata
Fuzzy Sets and Systems
Information Processing Letters
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Automata-theoretic model checking revisited
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
The Büchi complementation saga
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Enhancing simulation for checking language containment
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Deterministic blow-ups of minimal nondeterministic finite automata over a fixed alphabet
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Alternating states for dual nondeterminism in imperative programming
Theoretical Computer Science
An automata theoretic approach to rational tree relations
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Church's problem and a tour through automata theory
Pillars of computer science
Pillars of computer science
Stone duality and the recognisable languages over an algebra
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Inference of Session Types From Control Flow
Electronic Notes in Theoretical Computer Science (ENTCS)
Checking experiments for stream X-machines
Theoretical Computer Science
An nlogn algorithm for hyper-minimizing a (minimized) deterministic automaton
Theoretical Computer Science
A play on regular expressions: functional pearl
Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
Two-way unary automata versus logarithmic space
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Schema for parallel insertion and deletion
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Descriptional complexity of (un)ambiguous finite state machines and pushdown automata
RP'10 Proceedings of the 4th international conference on Reachability problems
Basic notions in computational complexity
Algorithms and theory of computation handbook
From MTL to deterministic timed automata
FORMATS'10 Proceedings of the 8th international conference on Formal modeling and analysis of timed systems
Kleene, Rabin, and Scott are available
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Complexity of multi-head finite automata: Origins and directions
Theoretical Computer Science
Selected operations and applications of n-tape weighted finite-state machines
FSMNLP'09 Proceedings of the 8th international conference on Finite-state methods and natural language processing
Finite automata theory with membership values in lattices
Information Sciences: an International Journal
Extended computation tree logic
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Construction of minimal deterministic finite automata from biological motifs
Theoretical Computer Science
Synthesis of trigger properties
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Coping with selfish on-going behaviors
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Descriptional and computational complexity of finite automata---A survey
Information and Computation
Optimal simulation of self-verifying automata by deterministic automata
Information and Computation
Better hyper-minimization: not as fast, but fewer errors
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Two-way unary automata versus logarithmic space
Information and Computation
Green's relations and their use in automata theory
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Partial derivatives of an extended regular expression
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
DLT'11 Proceedings of the 15th international conference on Developments in language theory
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Chop operations and expressions: descriptional complexity considerations
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Describing periodicity in two-way deterministic finite automata using transformation semigroups
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Nondeterministic Moore automata and Brzozowski's algorithm
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Nondeterministic state complexity of star-free languages
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
State complexity of four combined operations composed of union, intersection, star and reversal
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Note on reversal of binary regular languages
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Coping with selfish on-going behaviors
Information and Computation
Regular expressions and NFAs without Ε-transitions
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Lower bounds for complementation of ω-automata via the full automata technique
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Decidability in syntactic control of interference
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Size complexity of rotating and sweeping automata
Journal of Computer and System Sciences
Pairs of complementary unary languages with “balanced” nondeterministic automata
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Quotient complexity of ideal languages
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Regular languages with variables on graphs
Information and Computation
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Some complexity results for systemverilog assertions
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Magic numbers in the state hierarchy of finite automata
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Removing bidirectionality from nondeterministic finite automata
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Purely functional lazy nondeterministic programming
Journal of Functional Programming - Dedicated to ICFP 2009
Complementation constructions for nondeterministic automata on infinite words
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Nondeterministic fuzzy automata
Information Sciences: an International Journal
State complexity of concatenation and complementation of regular languages
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Size reduction of multitape automata
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Regular languages, unambiguous concatenation and computational complexity
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Regular expressions for two-dimensional languages over one-letter alphabet
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Theoretical Computer Science
State complexity of union and intersection of star on k regular languages
Theoretical Computer Science
Finding lower bounds for nondeterministic state complexity is hard
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Quantum automata theory – a review
Algebraic Foundations in Computer Science
An efficient coq tactic for deciding kleene algebras
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
Representing and visualizing mined artful processes in mailofmine
USAB'11 Proceedings of the 7th conference on Workgroup Human-Computer Interaction and Usability Engineering of the Austrian Computer Society: information Quality in e-Health
A class of rational n-WFSM auto-intersections
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Size reduction of multitape automata
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Frequency prediction of functions
MEMICS'11 Proceedings of the 7th international conference on Mathematical and Engineering Methods in Computer Science
Basic operations on binary suffix-free languages
MEMICS'11 Proceedings of the 7th international conference on Mathematical and Engineering Methods in Computer Science
Recent challenges and ideas in temporal synthesis
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Paper IV: Automata theory and control theory-A rapprochement
Automatica (Journal of IFAC)
On the relevance of abstract algebra to control theory
Automatica (Journal of IFAC)
On multi-head automata with restricted nondeterminism
Information Processing Letters
System identification via state characterization
Automatica (Journal of IFAC)
Oblivious two-way finite automata: decidability and complexity
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
An alternating hierarchy for finite automata
Theoretical Computer Science
Reversal of binary regular languages
Theoretical Computer Science
Nondeterministic state complexity of star-free languages
Theoretical Computer Science
Nondeterministic Moore automata and Brzozowski's minimization algorithm
Theoretical Computer Science
The complexity of asynchronous model based testing
Theoretical Computer Science
Efficient similarity search in very large string sets
SSDBM'12 Proceedings of the 24th international conference on Scientific and Statistical Database Management
A user-to-user relationship-based access control model for online social networks
DBSec'12 Proceedings of the 26th Annual IFIP WG 11.3 conference on Data and Applications Security and Privacy
State Complexity of Union and Intersection for Two-way Nondeterministic Finite Automata
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
Two-Way Reversible Multi-Head Finite Automata
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
On the Size of Unary Probabilistic and Nondeterministic Automata
Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Removing nondeterminism in constant height pushdown automata
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
State complexity of star and square of union of k regular languages
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
State complexity of chop operations on unary and finite languages
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
States and heads do count for unary multi-head finite automata
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
The state complexity of star-complement-star
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Regular Expressions for Languages over Infinite Alphabets
Fundamenta Informaticae
Rational relations having a rational trace on each finite intersection of rational relations
Theoretical Computer Science
State complexity of union and intersection of square and reversal on k regular languages
Theoretical Computer Science
State Complexity: Recent Results and Open Problems
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
State Complexity of Combined Operations with Union, Intersection, Star and Reversal
Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
Proceedings of the eighth ACM/IEEE symposium on Architectures for networking and communications systems
In search of most complex regular languages
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Tight bounds for the determinisation and complementation of generalised Büchi automata
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
On properties and state complexity of deterministic state-partition automata
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
Quotient complexity of ideal languages
Theoretical Computer Science
Rigorous approximated determinization of weighted automata
Theoretical Computer Science
Descriptional complexity of determinization and complementation for finite automata
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
Enforceable Security Policies Revisited
ACM Transactions on Information and System Security (TISSEC)
On the expressiveness of spider diagrams and commutative star-free regular languages
Journal of Visual Languages and Computing
Determinization of ordinal automata
Problems of Information Transmission
State complexity of star of union and square of union on k regular languages
Theoretical Computer Science
Nondeterminism in the presence of a diverse or unknown future
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Revisiting the equivalence problem for finite multitape automata
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
On the boundary of regular languages
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
From Monadic Second-Order Definable String Transformations to Transducers
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
From Two-Way to One-Way Finite State Transducers
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.06 |
Finite automata are considered in this paper as instruments for classifying finite tapes. Each one-tape automaton defines a set of tapes, a two-tape automaton defines a set of pairs of tapes, et cetera. The structure of the defined sets is studied. Various generalizations of the notion of an automaton are introduced and their relation to the classical automata is determined. Some decision problems concerning automata are shown to be solvable by effective algorithms; others turn out to be unsolvable by algorithms.