default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 32 matches
- 2020
- Valérie Berthé, Christiane Frougny, Michel Rigo, Jacques Sakarovitch:
The carry propagation of the successor function. Adv. Appl. Math. 120: 102062 (2020) - 2019
- Valérie Berthé, Christiane Frougny, Michel Rigo, Jacques Sakarovitch:
The carry propagation of the successor function. CoRR abs/1907.01464 (2019) - 2018
- Shigeki Akiyama, Victor Marsault, Jacques Sakarovitch:
On subtrees of the representation tree in rational base numeration systems. Discret. Math. Theor. Comput. Sci. 20(1) (2018) - 2017
- Victor Marsault, Jacques Sakarovitch:
The signature of rational languages. Theor. Comput. Sci. 658: 216-234 (2017) - Shigeki Akiyama, Victor Marsault, Jacques Sakarovitch:
On subtrees of the representation tree in rational base numeration systems. CoRR abs/1706.08266 (2017) - 2016
- Victor Marsault, Jacques Sakarovitch:
Trees and Languages with Periodic Signature. LATIN 2016: 605-618 - 2014
- Victor Marsault, Jacques Sakarovitch:
Breadth-First Serialisation of Trees and Rational Languages - (Short Paper). Developments in Language Theory 2014: 252-259 - Victor Marsault, Jacques Sakarovitch:
Rhythmic generation of infinite trees and languages. CoRR abs/1403.5190 (2014) - Victor Marsault, Jacques Sakarovitch:
Breadth-first serialisation of trees and rational languages. CoRR abs/1404.0798 (2014) - 2013
- Victor Marsault, Jacques Sakarovitch:
On Sets of Numbers Rationally Represented in a Rational Base Number System. CAI 2013: 89-100 - Shigeki Akiyama, Victor Marsault, Jacques Sakarovitch:
Auto-similarity in Rational Base Number Systems. WORDS 2013: 34-45 - Victor Marsault, Jacques Sakarovitch:
Ultimate Periodicity of b-Recognisable Sets: A Quasilinear Procedure. Developments in Language Theory 2013: 362-373 - Victor Marsault, Jacques Sakarovitch:
Ultimate periodicity of b-recognisable sets : a quasilinear procedure. CoRR abs/1301.2691 (2013) - Shigeki Akiyama, Victor Marsault, Jacques Sakarovitch:
Auto-similarity in rational base number systems. CoRR abs/1305.6757 (2013) - 2012
- Victor Marsault, Jacques Sakarovitch:
On sets of numbers rationally represented in a rational base number system. CoRR abs/1208.5412 (2012) - 2011
- Anssi Yli-Jyrä, András Kornai, Jacques Sakarovitch:
Finite-state methods and models in natural language processing. Nat. Lang. Eng. 17(2): 141-144 (2011) - 2010
- Anssi Yli-Jyrä, András Kornai, Jacques Sakarovitch, Bruce W. Watson:
Finite-State Methods and Natural Language Processing, 8th International Workshop, FSMNLP 2009, Pretoria, South Africa, July 21-24, 2009, Revised Selected Papers. Lecture Notes in Computer Science 6062, Springer 2010, ISBN 978-3-642-14683-1 [contents] - 2008
- Manfred Droste, Jacques Sakarovitch, Heiko Vogler:
Weighted automata with discounting. Inf. Process. Lett. 108(1): 23-28 (2008) - 2006
- Marie-Pierre Béal, Sylvain Lombardy, Jacques Sakarovitch:
Conjugacy and Equivalence of Weighted Automata and Functional Transducers. CSR 2006: 58-69 - 2005
- Marie-Pierre Béal, Sylvain Lombardy, Jacques Sakarovitch:
On the Equivalence of -Automata. ICALP 2005: 397-409 - 2003
- Marie-Pierre Béal, Olivier Carton, Christophe Prieur, Jacques Sakarovitch:
Squaring transducers: an efficient procedure for deciding functionality and sequentiality. Theor. Comput. Sci. 292(1): 45-63 (2003) - 2000
- Marie-Pierre Béal, Olivier Carton, Christophe Prieur, Jacques Sakarovitch:
Squaring Transducers: An Efficient Procedure for Deciding Functionality and Sequentiality of Transducers. LATIN 2000: 397-406 - 1999
- Maryse Pelletier, Jacques Sakarovitch:
On the Representation of Finite Deterministic 2-Tape Automata. Theor. Comput. Sci. 225(1-2): 1-63 (1999) - 1994
- Maryse Pelletier, Jacques Sakarovitch:
On the Lexicographic Uniformisation of Deterministic 2-Tape Automata (Extended Abstract). IFIP Congress (1) 1994: 485-490 - 1990
- Maryse Pelletier, Jacques Sakarovitch:
Easy Multiplications II. Extensions of Rational Semigroups. Inf. Comput. 88(1): 18-59 (1990) - 1986
- M. Benois, Jacques Sakarovitch:
On the Complexity of Some Extended Word Problems Defined by Cancellation Rules. Inf. Process. Lett. 23(6): 281-287 (1986) - 1978
- M. Sakarovitch:
Quelques theoremes de dualite combinatoire. Discret. Math. 21(2): 201-212 (1978) - 1977
- J. D. MacAllister, M. Sakarovitch:
Classification de certaines matrices 0-1. Discret. Math. 20: 133-142 (1977) - 1976
- M. Sakarovitch:
Quasi balanced matrices - An addendum. Math. Program. 10(1): 405-407 (1976) - 1975
- Michel Sakarovitch:
Sur quelques problèmes d'optimisation combinatoire. Grenoble Institute of Technology, France, 1975
skipping 2 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-11-19 13:47 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint