Teaching theory of computation at the junior level
APL '87 Proceedings of the international conference on APL: APL in transition
Undergraduate theory of computation: an approach using simulation tools
SIGCSE '88 Proceedings of the nineteenth SIGCSE technical symposium on Computer science education
A core course in computer theory: design and implementation issues
SIGCSE '89 Proceedings of the twentieth SIGCSE technical symposium on Computer science education
Hypercard automata simulation: finite-state, pushdown and Turing machines
ACM SIGCSE Bulletin
EURO-DAC '94 Proceedings of the conference on European design automation
Technical opinion: noncomputability is easy to understand
Communications of the ACM
Testing for Bounded Faults in RAMs
Journal of Electronic Testing: Theory and Applications
VisA: towards a students' green card to automata theory and formal languages
ACSE '98 Proceedings of the 3rd Australasian conference on Computer science education
SGML and XML document grammars and exceptions
Information and Computation
Subset construction complexity for homogeneous automata, position automata and ZPC-structures
Theoretical Computer Science
Normal form algorithms for extended context-free grammars
Theoretical Computer Science
Decidability of EDT0L structural equivalence
Theoretical Computer Science
Machine Mentality and the Nature of the Ground Relation
Minds and Machines
An Automated Analysis of Ping-Pong Interactions in E-mail Services
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Busy Beaver - The Influence of Representation
Proceedings of the Second European Workshop on Genetic Programming
Implementing Reversed Alternating Finite Automaton (r-AFA) Operations
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
Extended Context-Free Grammars and Normal Form Algorithms
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
Determinization of Glushkov Automata
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
State Complexity of Basic Operations on Finite Languages
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
Directly Constructing Minimal DFAs: Combining Two Algorithms by Brzozowski
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
VisA: A Tool for Visualizing and Animating Automata and Formal Languages
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Test Generation for Path-Delay Faults in One-dimensional Iterative Logic Arrays
ITC '00 Proceedings of the 2000 IEEE International Test Conference
Context-freeness of the power of context-free languages is undecidable
Theoretical Computer Science
Cache-Conscious Automata for XML Filtering
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
New Iteration Lemmata for Regular Languages
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
On the existence of prime decompositions
Theoretical Computer Science
Outfix-Free Regular Languages and Prime Outfix-Free Decomposition
Fundamenta Informaticae
Generalizations of 1-deterministic regular languages
Information and Computation
Information and Computation
Simple-regular expressions and languages
Journal of Automata, Languages and Combinatorics
Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
Fundamenta Informaticae
State Complexity of Combined Operations for Prefix-Free Regular Languages
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
State complexity of basic operations on suffix-free regular languages
Theoretical Computer Science
Implementation of State Elimination Using Heuristics
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
FPGA placement using space-filling curves: Theory meets practice
ACM Transactions on Embedded Computing Systems (TECS)
Markers and deterministic acceptors for non-deterministic languages
Journal of Automata, Languages and Combinatorics
Advances in Games Technology: Software, Models, and Intelligence
Simulation and Gaming
The algebraic approach I: the algebraization of the chomsky hierarchy
RelMiCS'08/AKA'08 Proceedings of the 10th international conference on Relational and kleene algebra methods in computer science, and 5th international conference on Applications of kleene algebra
Applying Weighted Finite State Machines to Protocol Performance Analysis
SEEFM '09 Proceedings of the 2009 Fourth South-East European Workshop on Formal Methods
Basic notions in computational complexity
Algorithms and theory of computation handbook
Algorithms and theory of computation handbook
Algorithms and theory of computation handbook
P systems with minimal insertion and deletion
Theoretical Computer Science
Some non-semi-decidability problems for linear and deterministic context-free languages
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
The generalization of generalized automata: expression automata
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Simplifying regular expressions: a quantitative perspective
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Prime decompositions of regular languages
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
The language, the expression, and the (small) automaton
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Shorter regular expressions from finite-state automata
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Transition Complexity of Incomplete DFAs
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
Fundamenta Informaticae
Computing the edit-distance between a regular language and a context-free language
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Outfix-Free Regular Languages and Prime Outfix-Free Decomposition
Fundamenta Informaticae
New Iteration Lemmata for Regular Languages
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Controlled H Systems and Chomsky Hierarchy
Fundamenta Informaticae
Controlled H Systems of Small Radius
Fundamenta Informaticae
State complexity of basic operations on suffix-free regular languages
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Non-blocking parallel subset construction on shared-memory multicore architectures
AusPDC '13 Proceedings of the Eleventh Australasian Symposium on Parallel and Distributed Computing - Volume 140
Approximate matching between a context-free grammar and a finite-state automaton
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
State Elimination Heuristics for Short Regular Expressions
Fundamenta Informaticae
| Hi-index | 0.02 |