The ω sequence problem for DOL systems is decidable
Journal of the ACM (JACM)
Concurrent transition system semantics of process networks
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Verifying temporal properties without temporal logic
ACM Transactions on Programming Languages and Systems (TOPLAS)
Decidability of the multiplicity equivalence of multitape finite automata
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Towards an algebraic theory of recursion
Journal of the ACM (JACM)
Integrating perception with problem solving
ACM SIGART Bulletin
AUTOMATE, a computing package for automata and finite semigroups
Journal of Symbolic Computation
Abstract machine models of cell metabolism
ACM SIGBIO Newsletter - Special edition on biologically motivated computing
Unification in commutative theories, Hilbert's basis theorem, and Gröbner bases
Journal of the ACM (JACM)
Interprocedural may-alias analysis for pointers: beyond k-limiting
PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
An equational framework for the flow analysis of higher order functional programs
LFP '94 Proceedings of the 1994 ACM conference on LISP and functional programming
Regular models of phonological rule systems
Computational Linguistics - Special issue on computational phonology
Deterministic part-of-speech tagging with finite-state transducers
Computational Linguistics
Semantic models and abstract interpretation techniques for inductive data structures and pointers
PEPM '95 Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Learning Sat-k-DNF formulas from membership queries
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Relative liveness and behavior abstraction (extended abstract)
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Automatic verification of parameterized linear networks of processes
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Algorithmic aspects in speech recognition: an introduction
Journal of Experimental Algorithmics (JEA)
Verifying parameterized networks
ACM Transactions on Programming Languages and Systems (TOPLAS)
Logical models of objects and of processes
ANSS '91 Proceedings of the 24th annual symposium on Simulation
Synchronization Problems Solvable by Generalized PV Systems
Journal of the ACM (JACM)
Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages
Journal of the ACM (JACM)
The Pattern-of-Calls Expansion Is the Canonical Fixpoint for Recursive Definitions
Journal of the ACM (JACM)
CSC '91 Proceedings of the 19th annual conference on Computer Science
Existential second-order logic over strings
Journal of the ACM (JACM)
Learning functions represented as multiplicity automata
Journal of the ACM (JACM)
ACM Transactions on Information and System Security (TISSEC)
On-the-Fly Algorithms and Sequential Machines
IEEE Transactions on Computers
Logic and programming languages
Communications of the ACM
Foundations of the Trace Assertion Method of Module Interface Specification
IEEE Transactions on Software Engineering
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Direct and dual laws for automata with multiplicities
Theoretical Computer Science
Iterated function systems and control languages
Information and Computation
Forty years of formal power series in automata theory
A half-century of automata theory
Journal of Symbolic Computation
Communication complexity method for measuring nondeterminism in finite automata
Information and Computation
POPL '75 Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Asymptotic behavior in a heap model with two pieces
Theoretical Computer Science
The commutation of finite sets: a challenging problem
Theoretical Computer Science
Theoretical Computer Science
Theoretical Computer Science
Iterated relabeling tree transducers
Theoretical Computer Science
Modelization of deterministic rational relations
Theoretical Computer Science
Nondeterminism and succinctly representable regular languages
SAICSIT '02 Proceedings of the 2002 annual research conference of the South African institute of computer scientists and information technologists on Enablement through technology
Characterization of opaque automata
Discrete Mathematics
Distances between languages and reflexivity of relations
Theoretical Computer Science
Bottom-up and top-down tree series transformations
Journal of Automata, Languages and Combinatorics
P Systems with replicated rewriting and stream X-machines (Eilenberg machines)
Fundamenta Informaticae - Membrane computing
Simulations of photosynthesis by a K-Subset transforming system with membrane
Fundamenta Informaticae - Membrane computing
The star problem and the finite power property in trace monoids: reductions beyond C4
Information and Computation
Conway's problem for three-word sets
Theoretical Computer Science
On the lattice of prefix codes
Theoretical Computer Science
The complexity of compressing subsegments of images described by finite automata
Discrete Applied Mathematics
Opacity of a finite automaton, method of calculation and the Ising chain
Discrete Applied Mathematics
A non-ambiguous decomposition of regular languages and factorizing codes
Discrete Applied Mathematics
Periodicity vectors for labelled trees
Discrete Applied Mathematics
Semiring frameworks and algorithms for shortest-distance problems
Journal of Automata, Languages and Combinatorics
More on generalized automatic sequences
Journal of Automata, Languages and Combinatorics
Pattern-matching problems for two-dimensional images described by finite automata
Nordic Journal of Computing
Squaring transducers: an efficient procedure for deciding functionality and sequentiality
Theoretical Computer Science
On a valuation of rational subsets ofZk Dédié à Jean Berstel
Theoretical Computer Science
On-line digit set conversion in real base
Theoretical Computer Science
Uniform and nonuniform recognizability
Theoretical Computer Science
Testing Collaborative Agents Defined as Stream X-Machines with Distributed Grammars
ECAL '01 Proceedings of the 6th European Conference on Advances in Artificial Life
Interpretation of Automata in Temporal Concept Analysis
ICCS '02 Proceedings of the 10th International Conference on Conceptual Structures: Integration and Interfaces
Average State Complexity of Operations on Unary Automata
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
MFCS '99 Proceedings of the 24th 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
Characterizing Simpler Recognizable Sets of Integers
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Derivation of Rational Expressions with Multiplicity
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Formal Modelling of Reactive Agents as an Aggregation of Simple Behaviours
SETN '02 Proceedings of the Second Hellenic Conference on AI: Methods and Applications of Artificial Intelligence
Finite Digital Synchronous Circuits Are Characterized by 2-Algebraic Truth Tables
ASIAN '00 Proceedings of the 6th Asian Computing Science Conference on Advances in Computing Science
On the Centralizer of a Finite Set
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Rational Transformations of Formal Power Series
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Constructing Finite Maximal Codes from Schützenberger Conjecture
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Conversion between Two Multiplicatively Dependent Linear Numeration Systems
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Star Height of Reversible Languages and Universal Automata
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
On Trace Assertion Method of Module Interface Specification with Concurrency
RSCTC '00 Revised Papers from the Second International Conference on Rough Sets and Current Trends in Computing
Real-Time Automata and the Kleene Algebra of Sets of Real Numbers
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
On the Enumerative Sequences of Regular Languages on k Symbols
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Calculating Church-Rosser Proofs in Kleene Algebra
ReIMICS '01 Revised Papers from the 6th International Conference and 1st Workshop of COST Action 274 TARSKI on Relational Methods in Computer Science
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
A Persistent-Set Approach to Abstract Stat-Space Construction in Verification
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
Algorithms on Compressed Strings and Arrays
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
Test Sets for the Universal and Existential Closure of Regular Tree Languages
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Automata and Computational Probabilities
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
Operations over Automata with Multiplicities
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
SEA: A Symbolic Environment for Automata Theory
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
Glushkov Construction for Multiplicities
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Random Number Generation with +-NFAs
CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
Brzozowski's Derivatives Extended to Multiplicities
CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
Multiset and K -Subset Transforming Systems
WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
High Level System Design and Analysis Using Abstract State Machines
FM-Trends 98 Proceedings of the International Workshop on Current Trends in Applied Formal Method: Applied Formal Methods
Learning Unary Output Two-Tape Automata from Multiplicity and Equivalence Queries
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
The Entropy of Lukasiewicz-Languages
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
A Short Introduction to Infinite Automata
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Decision Questions on Integer Matrices
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
The Compression of Subsegments of Images Described by Finite Automata
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
The Equivalence Problem for Computational Models: Decidable and Undecidable Cases
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Block-Deterministic Regular Languages
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Authenticity and Provability - A Formal Framework
InfraSec '02 Proceedings of the International Conference on Infrastructure Security
Fuzzy recognizers and recognizable sets
Fuzzy Sets and Systems - Mathematics
The finite power property in free groups
Theoretical Computer Science
Some properties of recognizable L-subsets
Theoretical Computer Science
The monadic quantifier alternation hierarchy over grids and graphs
Information and Computation - Special issue: LICS'97
A new class of algebraic series having a decidable equivalence problem
Fundamenta Informaticae
Borel hierarchy and omega context free languages
Theoretical Computer Science
On images of DOL and DTOL power series
Theoretical Computer Science
Some complexity results for polynomial rational expressions
Theoretical Computer Science
Regular component decomposition of regular languages
Theoretical Computer Science
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Ensembles reconnaissables de mots biinfinis
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
The &ohgr;-sequence equivalence problem for DOL systems is decidable
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Ambiguity in omega context free languages
Theoretical Computer Science
Weak bisimulation for (max/+) automata and related models
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Shape preserving top-down tree transducers
Theoretical Computer Science
PX systems = P systems + X machines
Natural Computing: an international journal
On transformations of formal power series
Information and Computation
Automata logics, and infinite games
On the generating sequences of regular languages on k symbols
Journal of the ACM (JACM)
The ring of k-regular sequences, II
Theoretical Computer Science - WORDS
Determinization of finite state weighted tree automata
Journal of Automata, Languages and Combinatorics
Two techniques in the area of the star problem in trace monoids
Theoretical Computer Science
Recognizable languages in divisibility monoids
Mathematical Structures in Computer Science
Observational trees as models for concurrency
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
Implementing collection classes with monads
Mathematical Structures in Computer Science
Synchronization of musical words
Theoretical Computer Science
A characterization of s-languages
Information Processing Letters
Natural languages and the Chomsky hierarchy
EACL '85 Proceedings of the second conference on European chapter of the Association for Computational Linguistics
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Derivatives of rational expressions and related theorems
Theoretical Computer Science - Implementation and application automata
Some properties of Ising automata
Theoretical Computer Science
Real numbers having ultimately periodic representations in abstract numeration systems
Information and Computation
On groups whose word problem is solved by a counter automaton
Theoretical Computer Science
Rational Kernels: Theory and Algorithms
The Journal of Machine Learning Research
Journal of Automata, Languages and Combinatorics
Bimachines and structurally-reversed automata
Journal of Automata, Languages and Combinatorics
Testing conformance of a deterministic implementation against a non-deterministic stream X-machine
Theoretical Computer Science
Many aspects of defect theorems
Theoretical Computer Science - Words, languages and combinatorics
Unary algebras, semigroups and congruences on free semigroups
Theoretical Computer Science - Words, languages and combinatorics
Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
Theoretical Computer Science - Developments in language theory
Learning Local Transductions Is Hard
Journal of Logic, Language and Information
An optimal pre-determinization algorithm for weighted transducers
Theoretical Computer Science - Implementation and application of automata
Acyclic networks maximizing the printing complexity
Theoretical Computer Science - Implementation and application of automata
Verifying mutual exclusion and liveness properties with split preconditions
Journal of Computer Science and Technology
Succinct representations of languages by DFA with different levels of reliability
Theoretical Computer Science - Descriptional complexity of formal systems
Probabilistic Finite-State Machines-Part II
IEEE Transactions on Pattern Analysis and Machine Intelligence
Disambiguation of finite-state transducers
COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 1
Weighted rational transductions and their application to human language processing
HLT '94 Proceedings of the workshop on Human Language Technology
Control of Discrete-Event Systems with Partial Observations Using Coalgebra and Coinduction
Discrete Event Dynamic Systems
The structure of reflexive regular splicing languages via Schützenberger constants
Theoretical Computer Science
Arithmetic Meyer sets and finite automata
Information and Computation
Economy of description for basic constructions on rational transductions
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
Büchi automata and their degrees of nondeterminism and ambiguity
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
Algebraic recognizability of regular tree languages
Theoretical Computer Science - The art of theory
The existential theory of equations with rational constraints in free groups is PSPACE-complete
Information and Computation
A theory of computation based on quantum logic (I)
Theoretical Computer Science
Journal of Automata, Languages and Combinatorics
Linear splicing and syntactic monoid
Discrete Applied Mathematics
Testing against a non-controllable stream X-machine using state counting
Theoretical Computer Science
Separability of rational relations in A* × Nm by recognizable relations is decidable
Information Processing Letters
Representation of a class of nondeterministic semiautomata by canonical words
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Boolean restriction categories and taut monads
Theoretical Computer Science
Test sequence generation for controller verification and test with high coverage
ACM Transactions on Design Automation of Electronic Systems (TODAES)
ACM Transactions on Computational Logic (TOCL)
Theoretical Computer Science
On the power of circular splicing
Discrete Applied Mathematics - Special issue: Max-algebra
Derivatives of rational expressions with multiplicity
Theoretical Computer Science
Word problems recognisable by deterministic blind monoid automata
Theoretical Computer Science
Statistical modeling for unit selection in speech synthesis
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Prelanguages Versus Submonoids
Fundamenta Informaticae
Synchronized Shuffle on Backbones
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Nondeterministic Bimachines and Rational Relations with Finite Codomain
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Shuffle of Words and Araucaria Trees
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Kleene theorems for skew formal power series
Acta Cybernetica
A regular viewpoint on processes and algebra
Acta Cybernetica
Interprocedural definition-use chains of dynamic pointer-linked data structures
Scientific Programming
Equivalence in automata theory based on complete residuated lattice-valued logic
Fuzzy Sets and Systems
Fuzzy Sets and Systems
Weighted automata and weighted logics
Theoretical Computer Science
On alpha-adic expansions in Pisot bases
Theoretical Computer Science
Note: On a zeta function associated with automata and codes
Theoretical Computer Science
Note: On the separability of sparse context-free languages and of bounded rational relations
Theoretical Computer Science
Logic and programming languages
ACM Turing award lectures
A complete characterization of deterministic regular liveness properties
Theoretical Computer Science
On the recognizability of fuzzy languages II
Fuzzy Sets and Systems
On Some Dynamical Properties of Finite Cellular Automaton
IEEE Transactions on Computers
Durations and parametric model-checking in timed automata
ACM Transactions on Computational Logic (TOCL)
Another proof of Soittola's theorem
Theoretical Computer Science
Specifying module interfaces with finitely defined automata
ICCOMP'07 Proceedings of the 11th WSEAS International Conference on Computers
Fuzzification of Rational and Recognizable Sets
Fundamenta Informaticae
Turing machines and bimachines
Theoretical Computer Science
Coding of two-dimensional constraints of finite type by substitutions
Journal of Automata, Languages and Combinatorics
Shape preserving bottom-up tree transducers
Journal of Automata, Languages and Combinatorics
Coalgebraising Subsequential Transducers
Electronic Notes in Theoretical Computer Science (ENTCS)
Recognizable languages in divisibility monoids
Mathematical Structures in Computer Science
Weighted automata with discounting
Information Processing Letters
Testing data processing-oriented systems from stream X-machine models
Theoretical Computer Science
Generalizations of 1-deterministic regular languages
Information and Computation
N-rationality of a certain class of formal series
Information Processing Letters
Transformational design of an interactive component straddling communication streams
Journal of Computational Methods in Sciences and Engineering - Selected papers from the International Conference on Computer Science, Software Engineering, Information Technology, e-Business, and Applications, 2004
A pilot study of comparative customer comprehension between extreme x-machine and uml models
Proceedings of the Second ACM-IEEE international symposium on Empirical software engineering and measurement
Towards the Integration of Symbolic and Numerical Static Analysis
Verified Software: Theories, Tools, Experiments
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Engineering Societies in the Agents World VIII
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Hopcroft's Algorithm and Cyclic Automata
Language and Automata Theory and Applications
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Various Aspects of Finite Quantum Automata
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
On the Non-deterministic Communication Complexity of Regular Languages
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
The Synchronization Problem for Strongly Transitive Automata
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
On the Decidability of the Equivalence for k-Valued Transducers
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Using formal specifications to support testing
ACM Computing Surveys (CSUR)
Learning deterministically recognizable tree series
Journal of Automata, Languages and Combinatorics
Simple-regular expressions and languages
Journal of Automata, Languages and Combinatorics
Partial Conway and Iteration Semirings
Fundamenta Informaticae
On Rational Stochastic Languages
Fundamenta Informaticae
Finite n-tape automata over possibly infinite alphabets: Extending a theorem of Eilenberg et al.
Theoretical Computer Science
Framed Versus Unframed Two-Dimensional Languages
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Deterministic and unambiguous two-dimensional languages over one-letter alphabet
Theoretical Computer Science
Formal Structure of Sanskrit Text: Requirements Analysis for a Mechanical Sanskrit Processor
Sanskrit Computational Linguistics
Facets of Synthesis: Revisiting Church's Problem
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
Lattices of local two-dimensional languages
Theoretical Computer Science
Axiomatizing rational power series over natural numbers
Information and Computation
Automata theory based on complete residuated lattice-valued logic: A categorical approach
Fuzzy Sets and Systems
Bisimulation Minimisation of Weighted Automata on Unranked Trees
Fundamenta Informaticae
Leveraging Semantic Web Service Descriptions for Validation by Automated Functional Testing
ESWC 2009 Heraklion Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications
Learning with Weighted Transducers
Proceedings of the 2009 conference on Finite-State Methods and Natural Language Processing: Post-proceedings of the 7th International Workshop FSMNLP 2008
The computational status of physics
Natural Computing: an international journal
Circular sturmian words and Hopcroft's algorithm
Theoretical Computer Science
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Deciding determinism of caterpillar expressions
Theoretical Computer Science
Weighted automata and weighted logics with discounting
Theoretical Computer Science
A computational model for tiling recognizable two-dimensional languages
Theoretical Computer Science
Augmenting concept languages by transitive closure of roles: an alternative to terminological cycles
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Quantum finite automata and weighted automata
Journal of Automata, Languages and Combinatorics
The bag automaton: a model of nondeterministic storage
Journal of Automata, Languages and Combinatorics
A combinatorial study of k-valued rational relations
Journal of Automata, Languages and Combinatorics
Transforming communicating X-machines into P systems
Natural Computing: an international journal
Natural Computing: an international journal
Parsing algorithms based on tree automata
IWPT '09 Proceedings of the 11th International Conference on Parsing Technologies
On the power of circular splicing
Discrete Applied Mathematics
Linear splicing and syntactic monoid
Discrete Applied Mathematics
Metrics for Action-labelled Quantitative Transition Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Fuzzy regular languages over finite and infinite words
Fuzzy Sets and Systems
A categorical approach to lattice-valued fuzzy automata
Fuzzy Sets and Systems
Fuzzy Sets and Systems
The existential theory of equations with rational constraints in free groups is PSPACE-complete
Information and Computation
Model Checking for a Class of Weighted Automata
Discrete Event Dynamic Systems
Inference of finite-state transducers from regular languages
Pattern Recognition
Span-reachability and observability of bilinear hybrid systems
Automatica (Journal of IFAC)
Efficient algorithm for checking multiplicity equivalence for the finite Z - Σ*-automata
DLT'02 Proceedings of the 6th international conference on Developments in language theory
On-line odometers for two-sided symbolic dynamical systems
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Identifiability of discrete-time linear switched systems
Proceedings of the 13th ACM international conference on Hybrid systems: computation and control
Communicating X-machines: from theory to practice
PCI'01 Proceedings of the 8th Panhellenic conference on Informatics
Edit-distance of weighted automata
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Prime decompositions of regular prefix codes
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Feedback-free circuits in the algebra of transients
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Finite state lazy operations in NLP
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Star normal form, rational expressions, and glushkov WFAs properties
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
The myhill-nerode theorem for recognizable tree series
DLT'03 Proceedings of the 7th international conference on Developments in language theory
From Glushkov WFAs to rational expressions
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Computing languages by (Bounded) local sets
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Deciding the sequentiality of a finitely ambiguous max-plus automaton
DLT'03 Proceedings of the 7th international conference on Developments in language theory
WFSC: a new weighted finite state compiler
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Running time complexity of printing an acyclic automaton
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Deriving state-based implementations of interactive components with history abstractions
PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
Some undecidability results related to the star problem in trace monoids
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Finite automata and the writing of numbers
DLT'07 Proceedings of the 11th international conference on Developments in language theory
From determinism to non-determinism in recognizable two-dimensional languages
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Coding partitions: regularity, maximality and global ambiguity
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Coalgebraic foundations of linear systems
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Characterizations of hemirings by their h-ideals
Computers & Mathematics with Applications
Weighted and unweighted trace automata
Acta Cybernetica
Weighted automata and weighted logics with discounting
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Deterministic caterpillar expressions
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Tiling automaton: a computational model for recognizable two-dimensional languages
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
On generalizations of weighted finite automata and graphics applications
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
Tiling recognizable two-dimensional languages
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
Deterministic two-dimensional languages over one-letter alphabet
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
Regular expressions with timed dominoes
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and 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
Non-standard inferences in description logics
Non-standard inferences in description logics
Model theoretic complexity of automatic structures
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Verified decision procedures on context-free grammars
TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
Applying Weighted Finite State Machines to Protocol Performance Analysis
SEEFM '09 Proceedings of the 2009 Fourth South-East European Workshop on Formal Methods
Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages
Fundamenta Informaticae
Testing from X-machine specifications
Formal methods and testing
Fuzzy relation equations and reduction of fuzzy automata
Journal of Computer and System Sciences
On the regularity of circular splicing languages: a survey and new developments
Natural Computing: an international journal
Determinization of weighted finite automata over strong bimonoids
Information Sciences: an International Journal
Checking experiments for stream X-machines
Theoretical Computer Science
Coinduction in Concurrent Timed Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Why synchronous tree substitution grammars?
HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
The Journal of Machine Learning Research
Terminological cycles in KL-ONE-based knowledge representation languages
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
On factors of synchronized sequences
Theoretical Computer Science
Formalization of smart metering requirements
Proceedings of the International Workshop on Security and Dependability for Resource Constrained Embedded Systems
Parsing and translation algorithms based on weighted extended tree transducers
ATANLP '10 Proceedings of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing
Subsequential transducers: a coalgebraic perspective
Information and Computation
A brief excursion inside the class of tiling recognizable two-dimensional languages
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Numeration systems: a link between number theory and formal language theory
DLT'10 Proceedings of the 14th international conference on Developments in language theory
On the hybrid Černý-road coloring problem and Hamiltonian paths
DLT'10 Proceedings of the 14th international conference on Developments in language theory
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Automata with extremal minimality conditions
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Describing average- and longtime-behavior by weighted MSO logics
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Towards run-time monitoring of web services conformance to business-level agreements
TAIC PART'10 Proceedings of the 5th international academic and industrial conference on Testing - practice and research techniques
The algebra of lexical semantics
MOL'07/09 Proceedings of the 10th and 11th Biennial conference on The mathematics of language
Equivalence of set- and bag-valued orbits
Journal of Automata, Languages and Combinatorics
Automata and processes on multisets of communicating objects
Natural Computing: an international journal
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
Algebraic Myhill-Nerode Theorems
Theoretical Computer Science
An extensible architecture for run-time monitoring of conversational web services
Proceedings of the 3rd International Workshop on Monitoring, Adaptation and Beyond
Varieties of recognizable tree series over fields
Theoretical Computer Science
Coping with selfish on-going behaviors
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Infinite games and uniformization
ICLA'11 Proceedings of the 4th Indian conference on Logic and its applications
Simulating Finite Eilenberg Machines with a Reactive Engine
Electronic Notes in Theoretical Computer Science (ENTCS)
Representing real numbers in a generalized numeration system
Journal of Computer and System Sciences
The set of realizations of a max-plus linear sequence is semi-polyhedral
Journal of Computer and System Sciences
Brief paper: Model matching inclusion for input/state asynchronous sequential machines
Automatica (Journal of IFAC)
Information Processing Letters
Regular expressions on average and in the long run
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Simulations of weighted tree automata
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
An alternative to synchronous tree substitution grammars*
Natural Language Engineering
Identification of security requirements in systems of systems by functional security analysis
Architecting dependable systems VII
Weighted muller tree automata and weighted logics
Journal of Automata, Languages and Combinatorics
On computability and some decision problems of parametric weighted finite automata
Journal of Automata, Languages and Combinatorics
A unifying Kleene theorem for weighted finite automata
Rainbow of computer science
Weighted finite automata: computing with different topologies
UC'11 Proceedings of the 10th international conference on Unconventional computation
Applications of temporal conceptual semantic systems
KONT'07/KPP'07 Proceedings of the First international conference on Knowledge processing and data analysis
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Classification of string languages via tiling recognizable picture languages
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Singular artin monoids of finite coxeter type are automatic
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Classifying regular languages via cascade products of automata
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Syntactic complexity of ultimately periodic sets of integers
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Partial-realization theory for linear switched systems -A formal power series approach
Automatica (Journal of IFAC)
A cascade decomposition of weighted finite transition systems
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Some variants of the star height problem
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Problems parameterized by treewidth tractable in single exponential time: a logical approach
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
A formal modelling framework for developing multi-agent systems with dynamic structure and behaviour
CEEMAS'05 Proceedings of the 4th international Central and Eastern European conference on Multi-Agent Systems and Applications
Coping with selfish on-going behaviors
Information and Computation
Conjugacy and equivalence of weighted automata and functional transducers
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
On a maximal NFA without mergible states
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Weighted picture automata and weighted logics
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
On the equivalence of Z-automata
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Weighted automata and weighted logics
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
IWCIA'04 Proceedings of the 10th international conference on Combinatorial Image Analysis
On recognizable infinite array languages
IWCIA'04 Proceedings of the 10th international conference on Combinatorial Image Analysis
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Multi-tape automata with symbol classes
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Iterated TGR languages: membership problem and effective closure properties
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Radix cross-sections for length morphisms
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Modelling dynamically organised colonies of bio-entities
UPP'04 Proceedings of the 2004 international conference on Unconventional Programming Paradigms
States, transitions, and life tracks in temporal concept analysis
Formal Concept Analysis
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Languages representable by vertex-labeled graphs
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Varieties of codes and kraft inequality
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
WMC'04 Proceedings of the 5th international conference on Membrane Computing
On the minimal automaton of the shuffle of words and araucarias
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Deterministic automata on unranked trees
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Abstractions preserving parameter confidentiality
ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
Concatenation state machines and simple functions
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
Relating tree series transducers and weighted tree automata
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
On algebra of languages representable by vertex-labeled graphs
Theoretical Computer Science
Journal of Computer and System Sciences
Weighted automata and weighted logics on infinite words
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
On weakly ambiguous finite transducers
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Partial conway and iteration semiring-semimodule pairs
Algebraic Foundations in Computer Science
Rational transformations and a kleene theorem for power series over rational monoids
Algebraic Foundations in Computer Science
Quantum automata theory – a review
Algebraic Foundations in Computer Science
Valuations of weighted automata: doing it in a rational way
Algebraic Foundations in Computer Science
A new model for classifying DNA code inspired by neural networks and FSA
PKAW'06 Proceedings of the 9th Pacific Rim Knowledge Acquisition international conference on Advances in Knowledge Acquisition and Management
Turing machine representation in temporal concept analysis
ICFCA'05 Proceedings of the Third international conference on Formal Concept Analysis
The language, the expression, and the (small) automaton
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
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
A class of rational n-WFSM auto-intersections
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Hartmanis-Stearns conjecture on real time and transcendence
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
Visibly pushdown transducers with look-ahead
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Construction of fuzzy automata from fuzzy regular expressions
Fuzzy Sets and Systems
Towards a new conceptual framework for the modelling of dynamically distributed systems
1FACS'96 Proceedings of the 1st BCS-FACS conference on Northern Formal Methods
The geometry of distributions in formal methods
2FACS'97 Proceedings of the 2nd BCS-FACS conference on Northern Formal Methods
Recursion diagrams: ideas for a geometry of formal methods
3FACS'98 Proceedings of the 3rd BCS-FACS conference on Northern Formal Methods
Extremal minimality conditions on automata
Theoretical Computer Science
Functional models of neurobiological processes
Mathematical and Computer Modelling: An International Journal
Syntactical and automatic properties of sets of polynomials over finite fields
Finite Fields and Their Applications
Analysis of the SYM2 smart meter remote software download using formal methods reasoning
Proceedings of the International Workshop on Security and Dependability for Resource Constrained Embedded Systemss
From Glushkov WFAs to \mathbb{K}-Expressions
Fundamenta Informaticae
Weighted Extended Tree Transducers
Fundamenta Informaticae
Rough Approximations in Varieties of Regular Languages
Fundamenta Informaticae
Survey: Weighted Extended Top-down Tree Transducers Part II—Application in Machine Translation
Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
Bisimulation Minimisation of Weighted Automata on Unranked Trees
Fundamenta Informaticae
Iterating invertible binary transducers
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
On context-free languages of scattered words
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Learning in the limit with lattice-structured hypothesis spaces
Theoretical Computer Science
Some Varieties of Finite Tree Automata Related to Restricted Temporal Logics
Fundamenta Informaticae
Multi-Valued MSO Logics OverWords and Trees
Fundamenta Informaticae
Partial Conway and Iteration Semirings
Fundamenta Informaticae
On Rational Stochastic Languages
Fundamenta Informaticae
Fuzzification of Rational and Recognizable Sets
Fundamenta Informaticae
FG'10/FG'11 Proceedings of the 15th and 16th international conference on Formal Grammar
Synchronized Shuffle on Backbones
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Nondeterministic Bimachines and Rational Relations with Finite Codomain
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Shuffle of Words and Araucaria Trees
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Refinement in Finite State Machine Testing
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Complete Testing from a Stream X-Machine Specification
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
P Systems with Replicated Rewriting and Stream X-Machines (Eilenberg Machines)
Fundamenta Informaticae - Membrane Computing (WMC-CdeA2001)
Simulations of Photosynthesis by a $K$-Subset Transforming System with Membrane
Fundamenta Informaticae - Membrane Computing (WMC-CdeA2001)
A new class of algebraic series having a decidable equivalence problem
Fundamenta Informaticae
Formal modelling of a bio-inspired paradigm capable of exhibiting emergence
Proceedings of the Fifth Balkan Conference in Informatics
Prelanguages Versus Submonoids
Fundamenta Informaticae
Fundamenta Informaticae
Fundamenta Informaticae
TOWARDS AN ALGEBRAIC THEORY OF CONTEXT-FREE LANGUAGES
Fundamenta Informaticae
TWO-DIMENSIONAL FINITE STATE RECOGNIZABILITY
Fundamenta Informaticae
Rational Processes And Linear Systems In Gsp
Fundamenta Informaticae
Syntactic Complexity of Ultimately Periodic Sets of Integers and Application to a Decision Procedure
Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
Preservation of recognizability for weighted linear extended top-down tree transducers
ATANLP '12 Proceedings of the Workshop on Applications of Tree Automata Techniques in Natural Language Processing
Weighted automata and weighted MSO logics for average and long-time behaviors
Information and Computation
Strict local testability with consensus equals regularity
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Weighted nested word automata and logics over strong bimonoids
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
A disambiguation algorithm for finite automata and functional transducers
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
JSXM: a tool for automated test generation
SEFM'12 Proceedings of the 10th international conference on Software Engineering and Formal Methods
Weighted pushdown systems with indexed weight domains
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
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
Revisiting the equivalence problem for finite multitape automata
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
A uniformization theorem for nested word to word transductions
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Invertible transducers, iteration and coordinates
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Realization theory of discrete-time linear switched systems
Automatica (Journal of IFAC)
Classification of annotation semirings over containment of conjunctive queries
ACM Transactions on Database Systems (TODS)
Varieties and Covarieties of Languages (Extended Abstract)
Electronic Notes in Theoretical Computer Science (ENTCS)
Automata-Theoretic Semantics of Idealized Algol with Passive Expressions
Electronic Notes in Theoretical Computer Science (ENTCS)
On lattices of regular sets of natural integers closed under decrementation
Information Processing Letters
Geometrically minimal realizations of Boolean controlled systems
Automation and Remote Control
State Elimination Heuristics for Short Regular Expressions
Fundamenta Informaticae
| Hi-index | 0.08 |